./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- 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 02:05:05,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:05:05,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:05:05,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:05:05,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:05:05,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:05:05,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:05:05,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:05:05,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:05:05,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:05:05,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:05:05,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:05:05,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:05:05,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:05:05,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:05:05,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:05:05,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:05:05,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:05:05,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:05:05,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:05:05,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:05:05,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:05:05,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:05:05,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:05:05,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:05:05,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:05:05,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:05:05,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:05:05,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:05:05,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:05:05,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:05:05,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:05:05,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:05:05,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:05:05,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:05:05,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:05:05,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:05:05,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:05:05,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:05:05,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:05:05,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:05:05,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:05:05,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:05:05,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:05:05,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:05:05,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:05:05,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:05:05,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:05:05,264 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:05:05,265 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:05:05,265 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:05:05,265 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:05:05,266 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:05:05,266 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:05:05,266 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:05:05,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:05:05,267 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:05:05,267 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:05:05,267 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:05:05,267 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:05:05,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:05:05,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:05:05,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:05:05,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:05:05,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:05:05,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:05:05,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:05:05,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:05:05,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:05:05,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:05:05,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:05:05,271 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:05:05,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:05:05,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:05:05,272 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:05:05,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:05:05,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:05:05,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:05:05,272 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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2022-11-03 02:05:05,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:05:05,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:05:05,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:05:05,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:05:05,614 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:05:05,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-03 02:05:05,696 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/data/2d329e9d2/3cff58dd1f0447c6a12c3ee02b414c52/FLAG06447dd83 [2022-11-03 02:05:06,184 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:05:06,185 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-03 02:05:06,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/data/2d329e9d2/3cff58dd1f0447c6a12c3ee02b414c52/FLAG06447dd83 [2022-11-03 02:05:06,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/data/2d329e9d2/3cff58dd1f0447c6a12c3ee02b414c52 [2022-11-03 02:05:06,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:05:06,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:05:06,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:05:06,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:05:06,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:05:06,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:05:06" (1/1) ... [2022-11-03 02:05:06,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd49a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:06, skipping insertion in model container [2022-11-03 02:05:06,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:05:06" (1/1) ... [2022-11-03 02:05:06,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:05:06,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:05:06,860 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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-11-03 02:05:06,928 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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-11-03 02:05:06,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:05:06,989 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:05:07,004 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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-11-03 02:05:07,034 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_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-11-03 02:05:07,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:05:07,091 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:05:07,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07 WrapperNode [2022-11-03 02:05:07,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:05:07,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:05:07,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:05:07,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:05:07,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,170 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-11-03 02:05:07,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:05:07,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:05:07,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:05:07,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:05:07,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,235 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:05:07,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:05:07,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:05:07,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:05:07,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (1/1) ... [2022-11-03 02:05:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:05:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:07,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:05:07,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:05:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:05:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 02:05:07,311 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 02:05:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-03 02:05:07,311 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-03 02:05:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 02:05:07,312 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 02:05:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 02:05:07,312 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 02:05:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 02:05:07,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 02:05:07,313 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 02:05:07,313 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 02:05:07,313 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 02:05:07,313 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 02:05:07,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:05:07,313 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 02:05:07,314 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 02:05:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:05:07,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:05:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 02:05:07,314 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 02:05:07,404 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:05:07,406 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:05:07,915 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:05:08,135 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:05:08,135 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-03 02:05:08,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:05:08 BoogieIcfgContainer [2022-11-03 02:05:08,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:05:08,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:05:08,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:05:08,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:05:08,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:05:06" (1/3) ... [2022-11-03 02:05:08,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff1fdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:05:08, skipping insertion in model container [2022-11-03 02:05:08,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:05:07" (2/3) ... [2022-11-03 02:05:08,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff1fdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:05:08, skipping insertion in model container [2022-11-03 02:05:08,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:05:08" (3/3) ... [2022-11-03 02:05:08,150 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-03 02:05:08,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:05:08,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:05:08,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:05:08,239 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;@39ec0755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:05:08,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 02:05:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 90 states have internal predecessors, (129), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-03 02:05:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:05:08,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:08,255 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] [2022-11-03 02:05:08,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:08,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash -715024938, now seen corresponding path program 1 times [2022-11-03 02:05:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:08,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835413901] [2022-11-03 02:05:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:08,655 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 02:05:08,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:08,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835413901] [2022-11-03 02:05:08,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835413901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:08,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:08,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154249322] [2022-11-03 02:05:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:08,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:08,693 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 90 states have internal predecessors, (129), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:08,896 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2022-11-03 02:05:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-03 02:05:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:08,911 INFO L225 Difference]: With dead ends: 269 [2022-11-03 02:05:08,913 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 02:05:08,917 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 02:05:08,921 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 138 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:08,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 203 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:05:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 02:05:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-11-03 02:05:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 114 states have internal predecessors, (156), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-03 02:05:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2022-11-03 02:05:08,992 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 28 [2022-11-03 02:05:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:08,993 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2022-11-03 02:05:08,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-11-03 02:05:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:05:08,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:08,996 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] [2022-11-03 02:05:08,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:05:08,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1323713014, now seen corresponding path program 1 times [2022-11-03 02:05:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:08,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777042798] [2022-11-03 02:05:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:09,115 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 02:05:09,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:09,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777042798] [2022-11-03 02:05:09,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777042798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:09,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:09,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185076507] [2022-11-03 02:05:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:09,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:09,119 INFO L87 Difference]: Start difference. First operand 147 states and 202 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:09,238 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2022-11-03 02:05:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:09,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-03 02:05:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:09,252 INFO L225 Difference]: With dead ends: 303 [2022-11-03 02:05:09,253 INFO L226 Difference]: Without dead ends: 222 [2022-11-03 02:05:09,255 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 02:05:09,258 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:09,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 188 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:05:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-03 02:05:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2022-11-03 02:05:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 174 states have internal predecessors, (237), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-03 02:05:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2022-11-03 02:05:09,301 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 29 [2022-11-03 02:05:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:09,302 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2022-11-03 02:05:09,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2022-11-03 02:05:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:05:09,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:09,310 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] [2022-11-03 02:05:09,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:05:09,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1288342113, now seen corresponding path program 1 times [2022-11-03 02:05:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:09,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544895534] [2022-11-03 02:05:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:09,389 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 02:05:09,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:09,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544895534] [2022-11-03 02:05:09,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544895534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:09,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:09,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390502226] [2022-11-03 02:05:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:09,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:09,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:09,395 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:09,494 INFO L93 Difference]: Finished difference Result 458 states and 625 transitions. [2022-11-03 02:05:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-03 02:05:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:09,498 INFO L225 Difference]: With dead ends: 458 [2022-11-03 02:05:09,498 INFO L226 Difference]: Without dead ends: 306 [2022-11-03 02:05:09,505 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 02:05:09,508 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 46 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:09,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 261 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:05:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-03 02:05:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2022-11-03 02:05:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 234 states have (on average 1.376068376068376) internal successors, (322), 239 states have internal predecessors, (322), 37 states have call successors, (37), 20 states have call predecessors, (37), 19 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 02:05:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 394 transitions. [2022-11-03 02:05:09,553 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 394 transitions. Word has length 30 [2022-11-03 02:05:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:09,553 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 394 transitions. [2022-11-03 02:05:09,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:05:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 394 transitions. [2022-11-03 02:05:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:05:09,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:09,555 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 02:05:09,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:05:09,556 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1485955618, now seen corresponding path program 1 times [2022-11-03 02:05:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:09,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534654825] [2022-11-03 02:05:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:09,669 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 02:05:09,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:09,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534654825] [2022-11-03 02:05:09,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534654825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:09,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:09,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:05:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047877323] [2022-11-03 02:05:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:09,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:05:09,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:05:09,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:05:09,673 INFO L87 Difference]: Start difference. First operand 292 states and 394 transitions. 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 02:05:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:10,219 INFO L93 Difference]: Finished difference Result 565 states and 786 transitions. [2022-11-03 02:05:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:05:10,219 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 02:05:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:10,228 INFO L225 Difference]: With dead ends: 565 [2022-11-03 02:05:10,228 INFO L226 Difference]: Without dead ends: 505 [2022-11-03 02:05:10,229 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 02:05:10,241 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 401 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:10,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 448 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:05:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-03 02:05:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2022-11-03 02:05:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 371 states have (on average 1.3477088948787062) internal successors, (500), 379 states have internal predecessors, (500), 78 states have call successors, (78), 44 states have call predecessors, (78), 43 states have return successors, (94), 71 states have call predecessors, (94), 76 states have call successors, (94) [2022-11-03 02:05:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 672 transitions. [2022-11-03 02:05:10,321 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 672 transitions. Word has length 34 [2022-11-03 02:05:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:10,321 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 672 transitions. [2022-11-03 02:05:10,321 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 02:05:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 672 transitions. [2022-11-03 02:05:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:05:10,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:10,327 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:05:10,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:05:10,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2063684072, now seen corresponding path program 1 times [2022-11-03 02:05:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759249865] [2022-11-03 02:05:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:05:10,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759249865] [2022-11-03 02:05:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759249865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:10,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:10,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358288153] [2022-11-03 02:05:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:10,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:10,453 INFO L87 Difference]: Start difference. First operand 494 states and 672 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:05:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:10,547 INFO L93 Difference]: Finished difference Result 657 states and 890 transitions. [2022-11-03 02:05:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2022-11-03 02:05:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:10,554 INFO L225 Difference]: With dead ends: 657 [2022-11-03 02:05:10,554 INFO L226 Difference]: Without dead ends: 499 [2022-11-03 02:05:10,555 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 02:05:10,556 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:05:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-03 02:05:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 488. [2022-11-03 02:05:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 365 states have (on average 1.3315068493150686) internal successors, (486), 373 states have internal predecessors, (486), 78 states have call successors, (78), 44 states have call predecessors, (78), 43 states have return successors, (94), 71 states have call predecessors, (94), 76 states have call successors, (94) [2022-11-03 02:05:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 658 transitions. [2022-11-03 02:05:10,616 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 658 transitions. Word has length 43 [2022-11-03 02:05:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:10,617 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 658 transitions. [2022-11-03 02:05:10,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:05:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 658 transitions. [2022-11-03 02:05:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:05:10,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:10,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:10,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:05:10,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 87900133, now seen corresponding path program 1 times [2022-11-03 02:05:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034653426] [2022-11-03 02:05:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:05:10,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:10,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034653426] [2022-11-03 02:05:10,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034653426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:10,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:10,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269166449] [2022-11-03 02:05:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:10,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:10,700 INFO L87 Difference]: Start difference. First operand 488 states and 658 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:05:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:10,796 INFO L93 Difference]: Finished difference Result 737 states and 982 transitions. [2022-11-03 02:05:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:10,797 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-11-03 02:05:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:10,802 INFO L225 Difference]: With dead ends: 737 [2022-11-03 02:05:10,802 INFO L226 Difference]: Without dead ends: 534 [2022-11-03 02:05:10,803 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 02:05:10,806 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 122 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:10,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 186 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:05:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-11-03 02:05:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2022-11-03 02:05:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 404 states have (on average 1.3094059405940595) internal successors, (529), 412 states have internal predecessors, (529), 82 states have call successors, (82), 47 states have call predecessors, (82), 46 states have return successors, (98), 75 states have call predecessors, (98), 80 states have call successors, (98) [2022-11-03 02:05:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 709 transitions. [2022-11-03 02:05:10,888 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 709 transitions. Word has length 46 [2022-11-03 02:05:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:10,889 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 709 transitions. [2022-11-03 02:05:10,889 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:05:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 709 transitions. [2022-11-03 02:05:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:05:10,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:10,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:10,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:05:10,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1877600957, now seen corresponding path program 1 times [2022-11-03 02:05:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029735226] [2022-11-03 02:05:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:05:10,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:10,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029735226] [2022-11-03 02:05:10,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029735226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:10,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:05:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261104031] [2022-11-03 02:05:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:10,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:05:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:05:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:05:10,984 INFO L87 Difference]: Start difference. First operand 534 states and 709 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:05:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:11,193 INFO L93 Difference]: Finished difference Result 574 states and 756 transitions. [2022-11-03 02:05:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:05:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-11-03 02:05:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:11,197 INFO L225 Difference]: With dead ends: 574 [2022-11-03 02:05:11,197 INFO L226 Difference]: Without dead ends: 571 [2022-11-03 02:05:11,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:05:11,198 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 232 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:11,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 184 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:05:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-03 02:05:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 533. [2022-11-03 02:05:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 404 states have (on average 1.3044554455445545) internal successors, (527), 411 states have internal predecessors, (527), 81 states have call successors, (81), 47 states have call predecessors, (81), 46 states have return successors, (98), 75 states have call predecessors, (98), 80 states have call successors, (98) [2022-11-03 02:05:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 706 transitions. [2022-11-03 02:05:11,271 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 706 transitions. Word has length 47 [2022-11-03 02:05:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:11,272 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 706 transitions. [2022-11-03 02:05:11,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:05:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 706 transitions. [2022-11-03 02:05:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 02:05:11,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:11,274 INFO L195 NwaCegarLoop]: trace histogram [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 02:05:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:05:11,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1923326440, now seen corresponding path program 1 times [2022-11-03 02:05:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:11,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975729193] [2022-11-03 02:05:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:05:11,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975729193] [2022-11-03 02:05:11,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975729193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466703465] [2022-11-03 02:05:11,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:11,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:11,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:11,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:05:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:11,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:05:11,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:11,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:05:12,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466703465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [464785322] [2022-11-03 02:05:12,185 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-11-03 02:05:12,185 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:05:12,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:05:12,195 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:05:12,195 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:05:14,065 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 75 for LOIs [2022-11-03 02:05:14,076 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 90 for LOIs [2022-11-03 02:05:14,090 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 196 for LOIs [2022-11-03 02:05:15,314 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:05:25,781 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9652#(and (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-03 02:05:25,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:05:25,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:25,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-03 02:05:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399575395] [2022-11-03 02:05:25,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:25,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:05:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:05:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:05:25,784 INFO L87 Difference]: Start difference. First operand 533 states and 706 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:05:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:26,098 INFO L93 Difference]: Finished difference Result 976 states and 1274 transitions. [2022-11-03 02:05:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:05:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-03 02:05:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:26,104 INFO L225 Difference]: With dead ends: 976 [2022-11-03 02:05:26,104 INFO L226 Difference]: Without dead ends: 973 [2022-11-03 02:05:26,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:05:26,106 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 286 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:26,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 627 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:05:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-03 02:05:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 742. [2022-11-03 02:05:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 581 states have (on average 1.3080895008605853) internal successors, (760), 590 states have internal predecessors, (760), 100 states have call successors, (100), 60 states have call predecessors, (100), 59 states have return successors, (117), 92 states have call predecessors, (117), 99 states have call successors, (117) [2022-11-03 02:05:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 977 transitions. [2022-11-03 02:05:26,185 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 977 transitions. Word has length 48 [2022-11-03 02:05:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:26,186 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 977 transitions. [2022-11-03 02:05:26,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:05:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 977 transitions. [2022-11-03 02:05:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 02:05:26,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:26,189 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 02:05:26,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:26,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -153963260, now seen corresponding path program 1 times [2022-11-03 02:05:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:26,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539584814] [2022-11-03 02:05:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:26,702 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 02:05:26,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539584814] [2022-11-03 02:05:26,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539584814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:26,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:26,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:05:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719975539] [2022-11-03 02:05:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:05:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:05:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:05:26,705 INFO L87 Difference]: Start difference. First operand 742 states and 977 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 02:05:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:27,065 INFO L93 Difference]: Finished difference Result 1161 states and 1569 transitions. [2022-11-03 02:05:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:05:27,066 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 02:05:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:27,070 INFO L225 Difference]: With dead ends: 1161 [2022-11-03 02:05:27,070 INFO L226 Difference]: Without dead ends: 900 [2022-11-03 02:05:27,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:05:27,072 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 225 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:27,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 338 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:05:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-11-03 02:05:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 886. [2022-11-03 02:05:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 677 states have (on average 1.2968980797636631) internal successors, (878), 688 states have internal predecessors, (878), 130 states have call successors, (130), 78 states have call predecessors, (130), 77 states have return successors, (159), 120 states have call predecessors, (159), 129 states have call successors, (159) [2022-11-03 02:05:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1167 transitions. [2022-11-03 02:05:27,173 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1167 transitions. Word has length 59 [2022-11-03 02:05:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:27,174 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1167 transitions. [2022-11-03 02:05:27,174 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 02:05:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1167 transitions. [2022-11-03 02:05:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 02:05:27,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:27,177 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 02:05:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:05:27,177 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -597725691, now seen corresponding path program 1 times [2022-11-03 02:05:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885888409] [2022-11-03 02:05:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:27,222 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 02:05:27,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885888409] [2022-11-03 02:05:27,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885888409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:27,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:27,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124997655] [2022-11-03 02:05:27,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:27,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:27,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:27,224 INFO L87 Difference]: Start difference. First operand 886 states and 1167 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 02:05:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:27,353 INFO L93 Difference]: Finished difference Result 1327 states and 1773 transitions. [2022-11-03 02:05:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:27,354 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 02:05:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:27,360 INFO L225 Difference]: With dead ends: 1327 [2022-11-03 02:05:27,360 INFO L226 Difference]: Without dead ends: 973 [2022-11-03 02:05:27,362 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 02:05:27,363 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 28 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:27,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:05:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-03 02:05:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 917. [2022-11-03 02:05:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 702 states have (on average 1.3005698005698005) internal successors, (913), 713 states have internal predecessors, (913), 133 states have call successors, (133), 81 states have call predecessors, (133), 80 states have return successors, (162), 123 states have call predecessors, (162), 132 states have call successors, (162) [2022-11-03 02:05:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1208 transitions. [2022-11-03 02:05:27,470 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1208 transitions. Word has length 60 [2022-11-03 02:05:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:27,471 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1208 transitions. [2022-11-03 02:05:27,471 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 02:05:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1208 transitions. [2022-11-03 02:05:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-03 02:05:27,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:27,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 02:05:27,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:05:27,474 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -980507615, now seen corresponding path program 2 times [2022-11-03 02:05:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:27,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702013900] [2022-11-03 02:05:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 02:05:27,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:27,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702013900] [2022-11-03 02:05:27,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702013900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:27,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:27,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242147489] [2022-11-03 02:05:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:27,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:27,518 INFO L87 Difference]: Start difference. First operand 917 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:05:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:27,642 INFO L93 Difference]: Finished difference Result 1247 states and 1641 transitions. [2022-11-03 02:05:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-11-03 02:05:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:27,646 INFO L225 Difference]: With dead ends: 1247 [2022-11-03 02:05:27,647 INFO L226 Difference]: Without dead ends: 859 [2022-11-03 02:05:27,648 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 02:05:27,649 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 135 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:27,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 199 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:05:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-11-03 02:05:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 850. [2022-11-03 02:05:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 645 states have (on average 1.289922480620155) internal successors, (832), 657 states have internal predecessors, (832), 127 states have call successors, (127), 77 states have call predecessors, (127), 76 states have return successors, (156), 116 states have call predecessors, (156), 126 states have call successors, (156) [2022-11-03 02:05:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1115 transitions. [2022-11-03 02:05:27,736 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1115 transitions. Word has length 61 [2022-11-03 02:05:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:27,737 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1115 transitions. [2022-11-03 02:05:27,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:05:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1115 transitions. [2022-11-03 02:05:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 02:05:27,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:27,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:27,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:05:27,740 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 717283250, now seen corresponding path program 1 times [2022-11-03 02:05:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:27,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23838459] [2022-11-03 02:05:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:05:27,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:27,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23838459] [2022-11-03 02:05:27,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23838459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:27,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:27,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:05:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130787842] [2022-11-03 02:05:27,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:27,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:27,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:27,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:05:27,793 INFO L87 Difference]: Start difference. First operand 850 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:05:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:27,910 INFO L93 Difference]: Finished difference Result 977 states and 1274 transitions. [2022-11-03 02:05:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2022-11-03 02:05:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:27,913 INFO L225 Difference]: With dead ends: 977 [2022-11-03 02:05:27,913 INFO L226 Difference]: Without dead ends: 443 [2022-11-03 02:05:27,916 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 02:05:27,917 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 27 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:27,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 264 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:05:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-03 02:05:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-03 02:05:27,963 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 02:05:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 598 transitions. [2022-11-03 02:05:27,966 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 598 transitions. Word has length 73 [2022-11-03 02:05:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:27,967 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 598 transitions. [2022-11-03 02:05:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:05:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 598 transitions. [2022-11-03 02:05:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 02:05:27,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:27,975 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 02:05:27,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:05:27,975 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2033305335, now seen corresponding path program 1 times [2022-11-03 02:05:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:27,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699694248] [2022-11-03 02:05:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:28,079 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 02:05:28,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699694248] [2022-11-03 02:05:28,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699694248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406443622] [2022-11-03 02:05:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:28,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:28,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:28,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:05:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:28,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:05:28,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:28,253 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 02:05:28,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:28,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406443622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:28,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:05:28,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:05:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74803057] [2022-11-03 02:05:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:28,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:05:28,255 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 02:05:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:28,372 INFO L93 Difference]: Finished difference Result 845 states and 1149 transitions. [2022-11-03 02:05:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:28,372 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 02:05:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:28,375 INFO L225 Difference]: With dead ends: 845 [2022-11-03 02:05:28,376 INFO L226 Difference]: Without dead ends: 522 [2022-11-03 02:05:28,377 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 02:05:28,378 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 02:05:28,378 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 02:05:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-03 02:05:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 507. [2022-11-03 02:05:28,446 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 02:05:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2022-11-03 02:05:28,449 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 87 [2022-11-03 02:05:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:28,450 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2022-11-03 02:05:28,450 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 02:05:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2022-11-03 02:05:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 02:05:28,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:28,452 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 02:05:28,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:28,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:05:28,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1371971544, now seen corresponding path program 1 times [2022-11-03 02:05:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:28,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443287233] [2022-11-03 02:05:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:28,755 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 02:05:28,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:28,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443287233] [2022-11-03 02:05:28,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443287233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:28,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820867251] [2022-11-03 02:05:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:28,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:28,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:28,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:05:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:28,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:05:28,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:28,888 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 02:05:28,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820867251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:05:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:05:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729135592] [2022-11-03 02:05:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:28,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:05:28,890 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 02:05:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:28,987 INFO L93 Difference]: Finished difference Result 973 states and 1276 transitions. [2022-11-03 02:05:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:28,987 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 02:05:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:28,990 INFO L225 Difference]: With dead ends: 973 [2022-11-03 02:05:28,991 INFO L226 Difference]: Without dead ends: 603 [2022-11-03 02:05:28,992 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 02:05:28,993 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 02:05:28,993 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 02:05:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-03 02:05:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 533. [2022-11-03 02:05:29,051 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 02:05:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 695 transitions. [2022-11-03 02:05:29,054 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 695 transitions. Word has length 87 [2022-11-03 02:05:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:29,054 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 695 transitions. [2022-11-03 02:05:29,054 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 02:05:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 695 transitions. [2022-11-03 02:05:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 02:05:29,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:29,057 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 02:05:29,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:05:29,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -584056763, now seen corresponding path program 2 times [2022-11-03 02:05:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994570330] [2022-11-03 02:05:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:29,476 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 02:05:29,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:29,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994570330] [2022-11-03 02:05:29,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994570330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:29,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163751488] [2022-11-03 02:05:29,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:05:29,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:29,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:29,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:05:29,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:05:29,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:05:29,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:05:29,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:29,638 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 02:05:29,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:29,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163751488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:29,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:05:29,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:05:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752116920] [2022-11-03 02:05:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:29,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:05:29,641 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 02:05:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:29,762 INFO L93 Difference]: Finished difference Result 1036 states and 1393 transitions. [2022-11-03 02:05:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:29,763 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 02:05:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:29,767 INFO L225 Difference]: With dead ends: 1036 [2022-11-03 02:05:29,767 INFO L226 Difference]: Without dead ends: 640 [2022-11-03 02:05:29,769 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 02:05:29,769 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 02:05:29,770 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 02:05:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-03 02:05:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2022-11-03 02:05:29,837 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 02:05:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 806 transitions. [2022-11-03 02:05:29,841 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 806 transitions. Word has length 87 [2022-11-03 02:05:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:29,842 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 806 transitions. [2022-11-03 02:05:29,842 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 02:05:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 806 transitions. [2022-11-03 02:05:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 02:05:29,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:29,844 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 02:05:29,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:30,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:05:30,072 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1856996029, now seen corresponding path program 1 times [2022-11-03 02:05:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:30,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400565303] [2022-11-03 02:05:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:30,225 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 02:05:30,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400565303] [2022-11-03 02:05:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400565303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496586833] [2022-11-03 02:05:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:30,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:30,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:05:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:05:30,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:30,374 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 02:05:30,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:30,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496586833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:30,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:05:30,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:05:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396503432] [2022-11-03 02:05:30,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:30,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:05:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:30,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:05:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:05:30,377 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 02:05:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:30,504 INFO L93 Difference]: Finished difference Result 1467 states and 1905 transitions. [2022-11-03 02:05:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:05:30,505 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 02:05:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:30,509 INFO L225 Difference]: With dead ends: 1467 [2022-11-03 02:05:30,509 INFO L226 Difference]: Without dead ends: 854 [2022-11-03 02:05:30,511 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 02:05:30,512 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 02:05:30,512 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 02:05:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-03 02:05:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 685. [2022-11-03 02:05:30,591 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 02:05:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 885 transitions. [2022-11-03 02:05:30,595 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 885 transitions. Word has length 88 [2022-11-03 02:05:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:30,595 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 885 transitions. [2022-11-03 02:05:30,596 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 02:05:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 885 transitions. [2022-11-03 02:05:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 02:05:30,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:30,598 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 02:05:30,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:30,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:05:30,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1002503226, now seen corresponding path program 1 times [2022-11-03 02:05:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:30,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310321786] [2022-11-03 02:05:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:30,992 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 02:05:30,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:30,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310321786] [2022-11-03 02:05:30,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310321786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:30,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:30,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:05:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148359354] [2022-11-03 02:05:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:30,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:05:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:05:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:05:30,995 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 02:05:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:31,269 INFO L93 Difference]: Finished difference Result 1656 states and 2112 transitions. [2022-11-03 02:05:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:05:31,270 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 02:05:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:31,276 INFO L225 Difference]: With dead ends: 1656 [2022-11-03 02:05:31,276 INFO L226 Difference]: Without dead ends: 1169 [2022-11-03 02:05:31,278 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 02:05:31,278 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 02:05:31,279 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 02:05:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-11-03 02:05:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1131. [2022-11-03 02:05:31,425 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 02:05:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1431 transitions. [2022-11-03 02:05:31,431 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1431 transitions. Word has length 89 [2022-11-03 02:05:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:31,431 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1431 transitions. [2022-11-03 02:05:31,432 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 02:05:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1431 transitions. [2022-11-03 02:05:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-03 02:05:31,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:31,435 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 02:05:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:05:31,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash -513844346, now seen corresponding path program 1 times [2022-11-03 02:05:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:31,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325767370] [2022-11-03 02:05:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:31,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:31,651 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 02:05:31,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:31,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325767370] [2022-11-03 02:05:31,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325767370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:31,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308289638] [2022-11-03 02:05:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:31,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:31,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:31,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:31,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:05:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:31,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:05:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:31,886 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 02:05:31,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:32,090 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 02:05:32,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308289638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1718539277] [2022-11-03 02:05:32,094 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-03 02:05:32,094 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:05:32,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:05:32,095 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:05:32,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:05:43,196 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 95 for LOIs [2022-11-03 02:05:43,217 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-03 02:05:43,223 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-03 02:05:43,267 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 64 for LOIs [2022-11-03 02:05:43,364 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-03 02:05:43,538 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-03 02:05:44,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:05:57,914 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '39310#(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) (= ~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) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 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_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:05:57,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:05:57,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:57,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2022-11-03 02:05:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925139236] [2022-11-03 02:05:57,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:05:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:05:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2998, Unknown=0, NotChecked=0, Total=3306 [2022-11-03 02:05:57,918 INFO L87 Difference]: Start difference. First operand 1131 states and 1431 transitions. Second operand has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-03 02:05:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:59,698 INFO L93 Difference]: Finished difference Result 2480 states and 3150 transitions. [2022-11-03 02:05:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-03 02:05:59,699 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) Word has length 98 [2022-11-03 02:05:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:59,705 INFO L225 Difference]: With dead ends: 2480 [2022-11-03 02:05:59,705 INFO L226 Difference]: Without dead ends: 1349 [2022-11-03 02:05:59,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 269 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5156 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=951, Invalid=11481, Unknown=0, NotChecked=0, Total=12432 [2022-11-03 02:05:59,713 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 456 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:59,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1387 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:05:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-11-03 02:05:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 917. [2022-11-03 02:05:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 661 states have (on average 1.2223903177004538) internal successors, (808), 666 states have internal predecessors, (808), 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 02:05:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1112 transitions. [2022-11-03 02:05:59,850 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1112 transitions. Word has length 98 [2022-11-03 02:05:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:59,851 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1112 transitions. [2022-11-03 02:05:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-03 02:05:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1112 transitions. [2022-11-03 02:05:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:05:59,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:59,854 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 02:05:59,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:00,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:06:00,068 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -820585036, now seen corresponding path program 1 times [2022-11-03 02:06:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77762727] [2022-11-03 02:06:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:00,743 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 02:06:00,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:00,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77762727] [2022-11-03 02:06:00,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77762727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192713808] [2022-11-03 02:06:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:00,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:00,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:06:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:00,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 02:06:00,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:01,120 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 02:06:01,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:01,804 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 02:06:01,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192713808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:01,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [701378879] [2022-11-03 02:06:01,807 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-03 02:06:01,808 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:06:01,808 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:06:01,808 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:06:01,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:06:08,295 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2022-11-03 02:06:08,944 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-03 02:06:08,949 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-03 02:06:08,985 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 64 for LOIs [2022-11-03 02:06:09,057 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-03 02:06:09,295 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-03 02:06:09,649 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:06:24,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '45053#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~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) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 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|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:06:24,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:06:24,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:06:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-03 02:06:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90489759] [2022-11-03 02:06:24,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:06:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:06:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=5586, Unknown=0, NotChecked=0, Total=6162 [2022-11-03 02:06:24,848 INFO L87 Difference]: Start difference. First operand 917 states and 1112 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 02:06:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:30,067 INFO L93 Difference]: Finished difference Result 1942 states and 2387 transitions. [2022-11-03 02:06:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-03 02:06:30,068 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 02:06:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:30,074 INFO L225 Difference]: With dead ends: 1942 [2022-11-03 02:06:30,075 INFO L226 Difference]: Without dead ends: 1300 [2022-11-03 02:06:30,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9934 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=3045, Invalid=22715, Unknown=0, NotChecked=0, Total=25760 [2022-11-03 02:06:30,083 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1841 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 1238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1238 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:30,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 475 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1238 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:06:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-03 02:06:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1129. [2022-11-03 02:06:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 822 states have (on average 1.2080291970802919) internal successors, (993), 827 states have internal predecessors, (993), 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 02:06:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1351 transitions. [2022-11-03 02:06:30,271 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1351 transitions. Word has length 101 [2022-11-03 02:06:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:30,272 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1351 transitions. [2022-11-03 02:06:30,272 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 02:06:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1351 transitions. [2022-11-03 02:06:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 02:06:30,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:30,275 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 02:06:30,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:30,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:30,488 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash 861626592, now seen corresponding path program 1 times [2022-11-03 02:06:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:30,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036058231] [2022-11-03 02:06:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:30,761 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 02:06:30,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036058231] [2022-11-03 02:06:30,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036058231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048442336] [2022-11-03 02:06:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:30,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:30,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:30,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:30,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:06:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:30,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 02:06:30,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:30,970 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 02:06:30,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:31,181 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 02:06:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048442336] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:31,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:06:31,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2022-11-03 02:06:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382978959] [2022-11-03 02:06:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:31,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:06:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:06:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:06:31,183 INFO L87 Difference]: Start difference. First operand 1129 states and 1351 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 02:06:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:31,517 INFO L93 Difference]: Finished difference Result 2239 states and 2678 transitions. [2022-11-03 02:06:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:06:31,518 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 02:06:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:31,522 INFO L225 Difference]: With dead ends: 2239 [2022-11-03 02:06:31,522 INFO L226 Difference]: Without dead ends: 897 [2022-11-03 02:06:31,526 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 02:06:31,527 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 89 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:31,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 196 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:06:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-11-03 02:06:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 748. [2022-11-03 02:06:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 529 states have (on average 1.1512287334593572) internal successors, (609), 535 states have internal predecessors, (609), 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 02:06:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 871 transitions. [2022-11-03 02:06:31,656 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 871 transitions. Word has length 102 [2022-11-03 02:06:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:31,657 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 871 transitions. [2022-11-03 02:06:31,657 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 02:06:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 871 transitions. [2022-11-03 02:06:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-03 02:06:31,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:31,661 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 02:06:31,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:31,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:31,874 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash -984513642, now seen corresponding path program 1 times [2022-11-03 02:06:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:31,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693201779] [2022-11-03 02:06:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:32,154 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 02:06:32,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693201779] [2022-11-03 02:06:32,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693201779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917197180] [2022-11-03 02:06:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:32,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:32,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:32,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:06:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:32,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:06:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:32,433 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 02:06:32,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:32,754 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 02:06:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917197180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105743140] [2022-11-03 02:06:32,758 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-03 02:06:32,758 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:06:32,758 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:06:32,758 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:06:32,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:06:41,339 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2022-11-03 02:06:42,171 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-03 02:06:42,176 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-03 02:06:42,213 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 131 for LOIs [2022-11-03 02:06:42,964 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-03 02:06:43,339 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-03 02:06:43,976 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:07:01,250 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '55622#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~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) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 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|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:07:01,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:07:01,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:07:01,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2022-11-03 02:07:01,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489717906] [2022-11-03 02:07:01,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:07:01,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:07:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:07:01,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:07:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3430, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 02:07:01,254 INFO L87 Difference]: Start difference. First operand 748 states and 871 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 02:07:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:02,054 INFO L93 Difference]: Finished difference Result 900 states and 1040 transitions. [2022-11-03 02:07:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:07:02,055 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 02:07:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:02,055 INFO L225 Difference]: With dead ends: 900 [2022-11-03 02:07:02,056 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:07:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 409 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=574, Invalid=6398, Unknown=0, NotChecked=0, Total=6972 [2022-11-03 02:07:02,065 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 185 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:02,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 680 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:07:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:07:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:07:02,067 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 02:07:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:07:02,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2022-11-03 02:07:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:02,068 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:07:02,069 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 02:07:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:07:02,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:07:02,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 02:07:02,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 02:07:02,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:02,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:07:02,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:07:19,894 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2022-11-03 02:07:19,896 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse25 (= ~p_num_write~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse24 (= ~t1_i~0 1)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (= ~p_dw_st~0 0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse0 (and .cse23 .cse25 .cse21 .cse24 .cse22 .cse19 .cse14 .cse27 .cse26 .cse20)) (.cse15 (not (= ~E_M~0 2))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse18 (not (= ~E_1~0 1))) (.cse1 (not .cse27)) (.cse2 (not .cse26)) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse25)) (.cse6 (not .cse24)) (.cse7 (not .cse23)) (.cse8 (not .cse22)) (.cse9 (not .cse21)) (.cse10 (not (= ~q_free~0 0))) (.cse11 (not .cse20)) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~E_M~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (< ~local~0 ~token~0)) .cse11 .cse12 (not (<= ~token~0 (+ ~local~0 1))) .cse13) (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (and .cse14 (= ~t1_st~0 0)) .cse15 .cse2 .cse3 .cse16 (not (= ~m_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 1) .cse9 .cse10 (and .cse19 (not (= ~m_st~0 0))) .cse11 .cse12 .cse13)))) [2022-11-03 02:07:19,896 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2022-11-03 02:07:19,896 INFO L895 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 2)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (= 2 ~p_dw_st~0) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-11-03 02:07:19,896 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-11-03 02:07:19,897 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-11-03 02:07:19,897 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-11-03 02:07:19,897 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-11-03 02:07:19,897 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-11-03 02:07:19,897 INFO L895 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 2)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (= 2 ~p_dw_st~0) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-11-03 02:07:19,898 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-11-03 02:07:19,898 INFO L902 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2022-11-03 02:07:19,898 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-11-03 02:07:19,899 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse11 (= ~E_M~0 2))) (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse13 (and .cse11 (= ~E_1~0 2))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse9 .cse10 (and (= ~E_1~0 |old(~E_1~0)|) .cse11) .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse13 .cse1 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 (not (= ~t1_st~0 0)) .cse12)))) [2022-11-03 02:07:19,899 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2022-11-03 02:07:19,900 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse15 (= |old(~m_st~0)| 0)) (.cse37 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (= ~m_pc~0 1)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse30 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse29) .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12)) (.cse36 (not (= ~E_1~0 1))) (.cse32 (not (= |old(~t1_st~0)| 0))) (.cse33 (not (= ~m_pc~0 ~t1_pc~0))) (.cse34 (and .cse37 (= ~t1_st~0 0))) (.cse13 (not (= ~E_M~0 2))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse17 (and (not .cse15) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse35 (not (= ~m_pc~0 0))) (.cse20 (not (= ~E_1~0 2))) (.cse26 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse10)) (.cse14 (not .cse11)) (.cse18 (not .cse1)) (.cse19 (not .cse4)) (.cse21 (not .cse6)) (.cse22 (not .cse2)) (.cse23 (not .cse7)) (.cse24 (not .cse5)) (.cse25 (not .cse9)) (.cse27 (not .cse12)) (.cse28 (not .cse3)) (.cse31 (not (= ~E_M~0 1)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse14 .cse15 .cse18 .cse19 .cse21 .cse22 .cse23 .cse29 .cse24 .cse25 .cse30 .cse27 .cse28 .cse31) (or .cse0 .cse13 .cse14 .cse15 .cse18 .cse19 .cse21 .cse22 .cse23 .cse29 .cse24 .cse25 .cse30 .cse27 .cse28) (or .cse32 .cse33 .cse0 .cse34 .cse13 .cse14 .cse15 .cse16 .cse35 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36 .cse27) (or (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse37 .cse10 .cse11 .cse12) .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36 .cse27) (or .cse32 .cse33 .cse0 .cse34 .cse13 .cse14 .cse16 .cse17 .cse35 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse14 .cse15 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 (not (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse37 .cse9 .cse10 .cse11 .cse12) .cse27 .cse28 (not (<= ~token~0 (+ ~local~0 1))) .cse31)))) [2022-11-03 02:07:19,900 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-11-03 02:07:19,900 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-11-03 02:07:19,900 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-11-03 02:07:19,901 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-11-03 02:07:19,901 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2022-11-03 02:07:19,902 INFO L895 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse19 (= ~m_pc~0 1)) (.cse6 (= |old(~m_st~0)| 0))) (let ((.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= ~t1_pc~0 1)) (.cse24 (= ~p_dw_pc~0 0)) (.cse25 (<= 2 ~E_1~0)) (.cse26 (= ~p_num_write~0 0)) (.cse27 (= ~c_num_read~0 0)) (.cse28 (= ~t1_i~0 1)) (.cse29 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse6)) (.cse31 (not .cse19)) (.cse32 (= ~q_free~0 0)) (.cse33 (= ~p_dw_st~0 0)) (.cse34 (= ~c_dr_pc~0 0)) (.cse35 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse22 (not (= ~E_M~0 1))) (.cse20 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse37 .cse31 .cse32 .cse33 (not (= ~m_st~0 0)) .cse34 .cse35)) (.cse21 (not .cse25)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (and .cse37 .cse36 (= ~t1_st~0 0))) (.cse38 (and (not .cse6) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse8 (not (= ~m_pc~0 0))) (.cse39 (not (= ~E_1~0 2))) (.cse2 (not .cse33)) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not .cse34)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse18 (not .cse23)) (.cse9 (not .cse26)) (.cse10 (not .cse28)) (.cse11 (not .cse24)) (.cse12 (not .cse29)) (.cse13 (not .cse27)) (.cse14 (not .cse32)) (.cse15 (not (<= ~local~0 ~token~0))) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse2 .cse5 .cse6 .cse18 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse20 .cse17 .cse21 .cse22) (or .cse2 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) .cse5 .cse6 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse36 .cse32 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse33 .cse34 .cse35) .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (< ~local~0 ~token~0)) .cse17 .cse21 (not (<= ~token~0 (+ ~local~0 1))) .cse22) (or .cse2 .cse4 .cse5 .cse6 .cse18 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse20 .cse17 .cse21) (or (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse37 .cse36 .cse32 .cse33 .cse34 .cse35) .cse2 .cse4 .cse5 .cse6 .cse7 .cse38 .cse18 .cse9 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse38 .cse8 .cse9 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (or (and .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse37 .cse36 .cse33 .cse34 .cse35) .cse2 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2022-11-03 02:07:19,902 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-11-03 02:07:19,903 INFO L895 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse36 (= ~m_st~0 0)) (.cse3 (= |old(~m_st~0)| 0)) (.cse10 (= ~m_pc~0 1))) (let ((.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= ~p_dw_pc~0 0)) (.cse35 (<= 2 ~E_1~0)) (.cse18 (= ~p_num_write~0 0)) (.cse30 (not (= ~m_pc~0 ~t1_pc~0))) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= ~t1_i~0 1)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (not .cse10)) (.cse37 (= ~q_free~0 0)) (.cse24 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse36)) .cse3)) (.cse25 (= ~p_dw_st~0 0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse5 (and .cse17 .cse35 .cse18 .cse30 .cse19 .cse20 .cse21 .cse22 .cse38 .cse37 .cse24 .cse25 .cse26 .cse27)) (.cse39 (not (= ~E_M~0 1))) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse31 (and .cse23 (= ~t1_st~0 0) .cse24 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (.cse33 (not (= ~m_pc~0 0))) (.cse28 (not (= ~E_1~0 1))) (.cse0 (not .cse25)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not .cse26)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse32 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not .cse18)) (.cse34 (not (= ~E_1~0 2))) (.cse7 (not .cse20)) (.cse8 (not .cse17)) (.cse9 (not .cse21)) (.cse11 (not .cse19)) (.cse12 (not .cse37)) (.cse16 (not (<= ~local~0 ~token~0))) (.cse13 (not .cse27)) (.cse14 (not .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse13) (or .cse29 .cse30 .cse0 .cse31 .cse1 .cse2 .cse15 .cse32 .cse33 .cse6 .cse34 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse13) (or .cse0 (and .cse17 .cse35 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse37 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse25 .cse26 .cse27) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 (and .cse17 .cse35 .cse18 .cse30 .cse19 .cse20 .cse21 .cse22 .cse38 .cse37 .cse25 .cse26 .cse27) .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 (not (<= ~token~0 (+ ~local~0 1))) .cse39) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39) (or .cse29 .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse15 .cse33 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse28 .cse13) (or .cse0 (and .cse17 .cse35 .cse18 .cse19 .cse20 (= ~m_st~0 ~E_M~0) .cse21 .cse22 .cse37 .cse24 .cse25 .cse26 .cse27) .cse1 .cse2 .cse3 .cse15 .cse32 .cse4 .cse6 .cse34 .cse7 .cse8 .cse9 .cse11 .cse12 .cse16 .cse13 .cse14))))) [2022-11-03 02:07:19,903 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-11-03 02:07:19,903 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2022-11-03 02:07:19,903 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2022-11-03 02:07:19,904 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,904 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse16 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 (not .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse20 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 (or .cse5 .cse21) .cse16 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse21) .cse9 .cse10 .cse11) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 (< ~local~0 ~token~0)))) [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-11-03 02:07:19,905 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-11-03 02:07:19,906 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-11-03 02:07:19,906 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2022-11-03 02:07:19,906 INFO L895 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (< ~local~0 ~token~0)) [2022-11-03 02:07:19,907 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,907 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:07:19,907 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-11-03 02:07:19,907 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2022-11-03 02:07:19,907 INFO L895 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (and (= ~c_dr_st~0 2) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:07:19,908 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0))) .cse4 (= ~m_st~0 ~E_M~0) .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13))) [2022-11-03 02:07:19,908 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-11-03 02:07:19,908 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-11-03 02:07:19,909 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-11-03 02:07:19,909 INFO L895 garLoopResultBuilder]: At program point L817(lines 817 826) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,909 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-11-03 02:07:19,910 INFO L895 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:07:19,910 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,910 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-11-03 02:07:19,910 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-11-03 02:07:19,911 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-11-03 02:07:19,911 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,912 INFO L895 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse16 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 (not .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse20 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 (or .cse5 .cse21) .cse16 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse21) .cse9 .cse10 .cse11) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 (< ~local~0 ~token~0)))) [2022-11-03 02:07:19,912 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)))) [2022-11-03 02:07:19,912 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:07:19,912 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-11-03 02:07:19,913 INFO L895 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2022-11-03 02:07:19,913 INFO L895 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-11-03 02:07:19,913 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-11-03 02:07:19,913 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,914 INFO L895 garLoopResultBuilder]: At program point L770-1(line 770) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,914 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-11-03 02:07:19,914 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,915 INFO L895 garLoopResultBuilder]: At program point L308-1(line 308) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,915 INFO L895 garLoopResultBuilder]: At program point L160(lines 160 164) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:07:19,915 INFO L895 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:07:19,915 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-11-03 02:07:19,916 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,916 INFO L895 garLoopResultBuilder]: At program point L821-1(line 821) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,916 INFO L899 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-11-03 02:07:19,916 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-11-03 02:07:19,917 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-11-03 02:07:19,917 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-11-03 02:07:19,917 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-11-03 02:07:19,917 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,917 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-11-03 02:07:19,918 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-11-03 02:07:19,918 INFO L895 garLoopResultBuilder]: At program point L856(lines 856 859) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,918 INFO L902 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-11-03 02:07:19,918 INFO L895 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:07:19,919 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,919 INFO L895 garLoopResultBuilder]: At program point L791-1(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,919 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-11-03 02:07:19,919 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-11-03 02:07:19,920 INFO L895 garLoopResultBuilder]: At program point L461(lines 461 465) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse14 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= ~t1_i~0 1)) (.cse19 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse7 .cse8 .cse10 .cse11 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse1 .cse2 (not .cse14) .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse12 .cse13 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18))) [2022-11-03 02:07:19,920 INFO L895 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,920 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-11-03 02:07:19,921 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-11-03 02:07:19,921 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-11-03 02:07:19,921 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 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) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,922 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 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) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,922 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,922 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-11-03 02:07:19,923 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse2 .cse3 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse4 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-03 02:07:19,923 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,923 INFO L895 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 (= ~m_st~0 2) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-03 02:07:19,924 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-11-03 02:07:19,924 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 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) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 02:07:19,924 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-11-03 02:07:19,924 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~E_1~0 1)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-11-03 02:07:19,925 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-11-03 02:07:19,925 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 ~E_M~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse15 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 (or .cse5 .cse15) (= ~t1_st~0 0) .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 (not .cse15) .cse9 .cse10 .cse11))) [2022-11-03 02:07:19,925 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-11-03 02:07:19,925 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0))) (or (and .cse0 .cse1 (= ~q_free~0 1) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 (= 2 ~p_dw_st~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:07:19,926 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2022-11-03 02:07:19,926 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-11-03 02:07:19,926 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-03 02:07:19,926 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-03 02:07:19,926 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-03 02:07:19,927 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2022-11-03 02:07:19,927 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2022-11-03 02:07:19,927 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2022-11-03 02:07:19,927 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse11 (= ~E_M~0 2))) (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse13 (and .cse11 (= ~E_1~0 2))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse9 .cse10 (and (= ~E_1~0 |old(~E_1~0)|) .cse11) .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 .cse12) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse13 .cse1 .cse14 .cse15 (not (= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17 (not (= ~t1_st~0 0)) .cse12)))) [2022-11-03 02:07:19,931 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:19,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:07:20,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:07:20 BoogieIcfgContainer [2022-11-03 02:07:20,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:07:20,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:07:20,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:07:20,006 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:07:20,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:05:08" (3/4) ... [2022-11-03 02:07:20,009 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:07:20,015 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 02:07:20,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-11-03 02:07:20,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-03 02:07:20,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-03 02:07:20,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-03 02:07:20,016 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-03 02:07:20,017 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-03 02:07:20,017 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-03 02:07:20,017 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-03 02:07:20,028 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2022-11-03 02:07:20,029 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-03 02:07:20,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:07:20,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:07:20,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) [2022-11-03 02:07:20,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-03 02:07:20,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) [2022-11-03 02:07:20,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) [2022-11-03 02:07:20,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(m_pc == t1_pc) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(p_num_write <= c_num_read)) || m_pc == 1) || 2 == p_dw_st) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write) [2022-11-03 02:07:20,153 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:07:20,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:07:20,156 INFO L158 Benchmark]: Toolchain (without parser) took 133611.41ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 84.6MB in the beginning and 1.0GB in the end (delta: -922.1MB). Peak memory consumption was 175.7MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,157 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:07:20,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.01ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 89.6MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.64ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 86.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,158 INFO L158 Benchmark]: Boogie Preprocessor took 61.99ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,159 INFO L158 Benchmark]: RCFGBuilder took 899.38ms. Allocated memory is still 117.4MB. Free memory was 84.3MB in the beginning and 88.9MB in the end (delta: -4.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,159 INFO L158 Benchmark]: TraceAbstraction took 131862.45ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.2MB in the beginning and 1.0GB in the end (delta: -927.9MB). Peak memory consumption was 743.4MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,160 INFO L158 Benchmark]: Witness Printer took 150.64ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:07:20,166 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.01ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 89.6MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.64ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 86.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.99ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 899.38ms. Allocated memory is still 117.4MB. Free memory was 84.3MB in the beginning and 88.9MB in the end (delta: -4.6MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * TraceAbstraction took 131862.45ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.2MB in the beginning and 1.0GB in the end (delta: -927.9MB). Peak memory consumption was 743.4MB. Max. memory is 16.1GB. * Witness Printer took 150.64ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: 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 10 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 131.7s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4738 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4696 mSDsluCounter, 7056 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4872 mSDsCounter, 1897 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4832 IncrementalHoareTripleChecker+Invalid, 6729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1897 mSolverCounterUnsat, 2866 mSDtfsCounter, 4832 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2105 GetRequests, 1642 SyntacticMatches, 20 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18596 ImplicationChecksByTransitivity, 61.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1131occurred in iteration=17, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 59 LocationsWithAnnotation, 2062 PreInvPairs, 2384 NumberOfFragments, 7644 HoareAnnotationTreeSize, 2062 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 59 FomulaSimplificationsInter, 150574 FormulaSimplificationTreeSizeReductionInter, 15.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2270 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2774 ConstructedInterpolants, 0 QuantifiedInterpolants, 6119 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3579 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 1623/1806 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: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token) || ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((!(m_pc == t1_pc) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(p_num_write <= c_num_read)) || m_pc == 1) || 2 == p_dw_st) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && local < token - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(q_free == 0)) || !(local < token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(E_1 == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(p_dw_st == 0) || ((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && p_num_write <= c_num_read + 1) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 817]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_num_read < p_num_write + 1) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 856]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) RESULT: Ultimate proved your program to be correct! [2022-11-03 02:07:20,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bc4be3-d343-49d5-b620-c1f1be6fd1dd/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