./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 8393723b 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/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_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS --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-8393723 [2022-11-19 07:39:03,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:39:03,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:39:03,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:39:03,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:39:03,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:39:03,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:39:03,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:39:03,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:39:03,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:39:03,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:39:03,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:39:03,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:39:03,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:39:03,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:39:03,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:39:03,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:39:03,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:39:03,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:39:03,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:39:03,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:39:03,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:39:03,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:39:03,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:39:03,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:39:03,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:39:03,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:39:03,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:39:03,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:39:03,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:39:03,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:39:03,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:39:03,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:39:03,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:39:03,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:39:03,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:39:03,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:39:03,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:39:03,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:39:03,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:39:03,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:39:03,381 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:39:03,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:39:03,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:39:03,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:39:03,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:39:03,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:39:03,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:39:03,420 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:39:03,420 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:39:03,421 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:39:03,421 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:39:03,422 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:39:03,422 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:39:03,422 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:39:03,422 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:39:03,422 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:39:03,423 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:39:03,423 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:39:03,423 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:39:03,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:39:03,424 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:39:03,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:39:03,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:39:03,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:39:03,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:39:03,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:39:03,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:39:03,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:39:03,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:39:03,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:39:03,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:39:03,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:39:03,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:39:03,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:39:03,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:39:03,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:39:03,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:39:03,430 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/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_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS 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-19 07:39:03,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:39:03,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:39:03,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:39:03,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:39:03,725 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:39:03,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-19 07:39:03,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/data/3016b2cf6/da0284ee0d03465eb4efd2686e5675f6/FLAG0673257ad [2022-11-19 07:39:04,411 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:39:04,411 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-19 07:39:04,432 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/data/3016b2cf6/da0284ee0d03465eb4efd2686e5675f6/FLAG0673257ad [2022-11-19 07:39:04,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/data/3016b2cf6/da0284ee0d03465eb4efd2686e5675f6 [2022-11-19 07:39:04,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:39:04,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:39:04,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:39:04,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:39:04,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:39:04,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:04" (1/1) ... [2022-11-19 07:39:04,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@950230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:04, skipping insertion in model container [2022-11-19 07:39:04,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:04" (1/1) ... [2022-11-19 07:39:04,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:39:04,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:39:05,055 WARN L234 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-11-19 07:39:05,122 WARN L234 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-11-19 07:39:05,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:39:05,180 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:39:05,195 WARN L234 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-11-19 07:39:05,224 WARN L234 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_e3a74090-8561-422e-acd9-0ca1bbb4f491/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-11-19 07:39:05,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:39:05,279 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:39:05,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05 WrapperNode [2022-11-19 07:39:05,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:39:05,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:39:05,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:39:05,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:39:05,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,355 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-11-19 07:39:05,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:39:05,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:39:05,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:39:05,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:39:05,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:39:05,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:39:05,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:39:05,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:39:05,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (1/1) ... [2022-11-19 07:39:05,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:39:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:05,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:39:05,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:39:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:39:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-19 07:39:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-19 07:39:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-19 07:39:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-19 07:39:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-19 07:39:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-19 07:39:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-19 07:39:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-19 07:39:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-19 07:39:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-19 07:39:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-19 07:39:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-19 07:39:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-19 07:39:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-19 07:39:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:39:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-19 07:39:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-19 07:39:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:39:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:39:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-19 07:39:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-19 07:39:05,577 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:39:05,579 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:39:06,181 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:39:06,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:39:06,354 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-19 07:39:06,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06 BoogieIcfgContainer [2022-11-19 07:39:06,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:39:06,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:39:06,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:39:06,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:39:06,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:04" (1/3) ... [2022-11-19 07:39:06,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d7cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:06, skipping insertion in model container [2022-11-19 07:39:06,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:05" (2/3) ... [2022-11-19 07:39:06,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d7cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:06, skipping insertion in model container [2022-11-19 07:39:06,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06" (3/3) ... [2022-11-19 07:39:06,369 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-11-19 07:39:06,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:39:06,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:39:06,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:39:06,461 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;@544402b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:39:06,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-19 07:39:06,465 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-19 07:39:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:39:06,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:06,475 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-19 07:39:06,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -715024938, now seen corresponding path program 1 times [2022-11-19 07:39:06,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:06,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742320750] [2022-11-19 07:39:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:06,881 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-19 07:39:06,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:06,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742320750] [2022-11-19 07:39:06,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742320750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:06,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:06,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528542275] [2022-11-19 07:39:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:06,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:06,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:06,930 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-19 07:39:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:07,159 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2022-11-19 07:39:07,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:07,161 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-19 07:39:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:07,176 INFO L225 Difference]: With dead ends: 269 [2022-11-19 07:39:07,176 INFO L226 Difference]: Without dead ends: 151 [2022-11-19 07:39:07,180 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-19 07:39:07,184 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 138 mSDsluCounter, 55 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-19 07:39:07,186 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-19 07:39:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-19 07:39:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-11-19 07:39:07,240 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-19 07:39:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2022-11-19 07:39:07,245 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 28 [2022-11-19 07:39:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:07,247 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2022-11-19 07:39:07,247 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-19 07:39:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-11-19 07:39:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:39:07,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:07,252 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-19 07:39:07,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:39:07,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1323713014, now seen corresponding path program 1 times [2022-11-19 07:39:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:07,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281995138] [2022-11-19 07:39:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:07,354 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-19 07:39:07,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281995138] [2022-11-19 07:39:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281995138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:07,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:07,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690268831] [2022-11-19 07:39:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:07,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:07,359 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-19 07:39:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:07,439 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2022-11-19 07:39:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:07,439 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-19 07:39:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:07,442 INFO L225 Difference]: With dead ends: 303 [2022-11-19 07:39:07,442 INFO L226 Difference]: Without dead ends: 222 [2022-11-19 07:39:07,443 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-19 07:39:07,444 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 53 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-19 07:39:07,445 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-19 07:39:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-19 07:39:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2022-11-19 07:39:07,472 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-19 07:39:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2022-11-19 07:39:07,474 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 29 [2022-11-19 07:39:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:07,475 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2022-11-19 07:39:07,475 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-19 07:39:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2022-11-19 07:39:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 07:39:07,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:07,477 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-19 07:39:07,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:39:07,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1288342113, now seen corresponding path program 1 times [2022-11-19 07:39:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:07,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691713969] [2022-11-19 07:39:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:07,526 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-19 07:39:07,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691713969] [2022-11-19 07:39:07,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691713969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:07,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662658543] [2022-11-19 07:39:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:07,529 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-19 07:39:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:07,636 INFO L93 Difference]: Finished difference Result 458 states and 625 transitions. [2022-11-19 07:39:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:07,636 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-19 07:39:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:07,641 INFO L225 Difference]: With dead ends: 458 [2022-11-19 07:39:07,642 INFO L226 Difference]: Without dead ends: 306 [2022-11-19 07:39:07,649 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-19 07:39:07,653 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 46 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 07:39:07,654 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-19 07:39:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-19 07:39:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2022-11-19 07:39:07,709 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-19 07:39:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 394 transitions. [2022-11-19 07:39:07,713 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 394 transitions. Word has length 30 [2022-11-19 07:39:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:07,713 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 394 transitions. [2022-11-19 07:39:07,714 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-19 07:39:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 394 transitions. [2022-11-19 07:39:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 07:39:07,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:07,719 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-19 07:39:07,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:39:07,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1485955618, now seen corresponding path program 1 times [2022-11-19 07:39:07,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:07,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904521504] [2022-11-19 07:39:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:07,870 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-19 07:39:07,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:07,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904521504] [2022-11-19 07:39:07,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904521504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:07,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:07,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:39:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609645361] [2022-11-19 07:39:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:07,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:39:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:07,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:39:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:39:07,874 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-19 07:39:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:08,393 INFO L93 Difference]: Finished difference Result 565 states and 786 transitions. [2022-11-19 07:39:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:39:08,394 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-19 07:39:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:08,398 INFO L225 Difference]: With dead ends: 565 [2022-11-19 07:39:08,398 INFO L226 Difference]: Without dead ends: 505 [2022-11-19 07:39:08,399 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-19 07:39:08,400 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 401 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 451 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-19 07:39:08,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 451 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:39:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-19 07:39:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2022-11-19 07:39:08,457 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-19 07:39:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 672 transitions. [2022-11-19 07:39:08,460 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 672 transitions. Word has length 34 [2022-11-19 07:39:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:08,460 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 672 transitions. [2022-11-19 07:39:08,461 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-19 07:39:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 672 transitions. [2022-11-19 07:39:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-19 07:39:08,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:08,463 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-19 07:39:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:39:08,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2063684072, now seen corresponding path program 1 times [2022-11-19 07:39:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:08,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602117479] [2022-11-19 07:39:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:08,516 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-19 07:39:08,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602117479] [2022-11-19 07:39:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602117479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:08,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:08,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075186355] [2022-11-19 07:39:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:08,520 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-19 07:39:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:08,618 INFO L93 Difference]: Finished difference Result 657 states and 890 transitions. [2022-11-19 07:39:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:08,619 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-19 07:39:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:08,623 INFO L225 Difference]: With dead ends: 657 [2022-11-19 07:39:08,623 INFO L226 Difference]: Without dead ends: 499 [2022-11-19 07:39:08,624 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-19 07:39:08,624 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 32 mSDsluCounter, 129 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:08,625 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.1s Time] [2022-11-19 07:39:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-19 07:39:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 488. [2022-11-19 07:39:08,671 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-19 07:39:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 658 transitions. [2022-11-19 07:39:08,674 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 658 transitions. Word has length 43 [2022-11-19 07:39:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:08,675 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 658 transitions. [2022-11-19 07:39:08,675 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-19 07:39:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 658 transitions. [2022-11-19 07:39:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 07:39:08,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:08,677 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-19 07:39:08,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:39:08,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash 87900133, now seen corresponding path program 1 times [2022-11-19 07:39:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:08,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921223266] [2022-11-19 07:39:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:08,718 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-19 07:39:08,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921223266] [2022-11-19 07:39:08,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921223266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:08,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:08,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149621713] [2022-11-19 07:39:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:08,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:08,721 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-19 07:39:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:08,827 INFO L93 Difference]: Finished difference Result 737 states and 982 transitions. [2022-11-19 07:39:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:08,828 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-19 07:39:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:08,831 INFO L225 Difference]: With dead ends: 737 [2022-11-19 07:39:08,831 INFO L226 Difference]: Without dead ends: 534 [2022-11-19 07:39:08,832 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-19 07:39:08,833 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 122 mSDsluCounter, 52 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-19 07:39:08,833 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-19 07:39:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-11-19 07:39:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2022-11-19 07:39:08,886 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-19 07:39:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 709 transitions. [2022-11-19 07:39:08,889 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 709 transitions. Word has length 46 [2022-11-19 07:39:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:08,890 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 709 transitions. [2022-11-19 07:39:08,890 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-19 07:39:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 709 transitions. [2022-11-19 07:39:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-19 07:39:08,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:08,892 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-19 07:39:08,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:39:08,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1877600957, now seen corresponding path program 1 times [2022-11-19 07:39:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155009154] [2022-11-19 07:39:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:08,961 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-19 07:39:08,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:08,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155009154] [2022-11-19 07:39:08,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155009154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:08,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:08,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:39:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862087452] [2022-11-19 07:39:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:08,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:39:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:39:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:39:08,964 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-19 07:39:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:09,187 INFO L93 Difference]: Finished difference Result 574 states and 756 transitions. [2022-11-19 07:39:09,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:39:09,187 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-19 07:39:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:09,191 INFO L225 Difference]: With dead ends: 574 [2022-11-19 07:39:09,191 INFO L226 Difference]: Without dead ends: 571 [2022-11-19 07:39:09,191 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-19 07:39:09,192 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 232 mSDsluCounter, 41 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-19 07:39:09,193 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-19 07:39:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-19 07:39:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 533. [2022-11-19 07:39:09,264 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-19 07:39:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 706 transitions. [2022-11-19 07:39:09,267 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 706 transitions. Word has length 47 [2022-11-19 07:39:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:09,268 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 706 transitions. [2022-11-19 07:39:09,268 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-19 07:39:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 706 transitions. [2022-11-19 07:39:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 07:39:09,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:09,270 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-19 07:39:09,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:39:09,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1923326440, now seen corresponding path program 1 times [2022-11-19 07:39:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:09,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937441818] [2022-11-19 07:39:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:09,409 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-19 07:39:09,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:09,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937441818] [2022-11-19 07:39:09,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937441818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:09,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545408049] [2022-11-19 07:39:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:09,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:09,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:09,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:09,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:39:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:09,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 07:39:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:09,918 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-19 07:39:09,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:39:10,075 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-19 07:39:10,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545408049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:39:10,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [112708375] [2022-11-19 07:39:10,094 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-11-19 07:39:10,094 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:39:10,097 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:39:10,102 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:39:10,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:39:11,923 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 75 for LOIs [2022-11-19 07:39:11,931 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 90 for LOIs [2022-11-19 07:39:11,943 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 196 for LOIs [2022-11-19 07:39:13,027 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:39:23,295 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-19 07:39:23,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:39:23,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:39:23,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-19 07:39:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474430890] [2022-11-19 07:39:23,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:39:23,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:39:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:23,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:39:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 07:39:23,298 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-19 07:39:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:23,646 INFO L93 Difference]: Finished difference Result 976 states and 1274 transitions. [2022-11-19 07:39:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:39:23,647 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-19 07:39:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:23,652 INFO L225 Difference]: With dead ends: 976 [2022-11-19 07:39:23,652 INFO L226 Difference]: Without dead ends: 973 [2022-11-19 07:39:23,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 07:39:23,654 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 286 mSDsluCounter, 430 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-19 07:39:23,654 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-19 07:39:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-19 07:39:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 742. [2022-11-19 07:39:23,727 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-19 07:39:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 977 transitions. [2022-11-19 07:39:23,731 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 977 transitions. Word has length 48 [2022-11-19 07:39:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:23,731 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 977 transitions. [2022-11-19 07:39:23,732 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-19 07:39:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 977 transitions. [2022-11-19 07:39:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-19 07:39:23,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:23,734 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-19 07:39:23,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:39:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:23,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -153963260, now seen corresponding path program 1 times [2022-11-19 07:39:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333934784] [2022-11-19 07:39:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:24,187 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-19 07:39:24,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333934784] [2022-11-19 07:39:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333934784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:24,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:24,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:39:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319759525] [2022-11-19 07:39:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:24,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:39:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:39:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:39:24,189 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-19 07:39:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:24,533 INFO L93 Difference]: Finished difference Result 1161 states and 1569 transitions. [2022-11-19 07:39:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:39:24,533 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-19 07:39:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:24,538 INFO L225 Difference]: With dead ends: 1161 [2022-11-19 07:39:24,538 INFO L226 Difference]: Without dead ends: 900 [2022-11-19 07:39:24,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:39:24,540 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 228 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:24,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 325 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:39:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-11-19 07:39:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 886. [2022-11-19 07:39:24,635 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-19 07:39:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1167 transitions. [2022-11-19 07:39:24,639 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1167 transitions. Word has length 59 [2022-11-19 07:39:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:24,639 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1167 transitions. [2022-11-19 07:39:24,640 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-19 07:39:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1167 transitions. [2022-11-19 07:39:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 07:39:24,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:24,642 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-19 07:39:24,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:39:24,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -597725691, now seen corresponding path program 1 times [2022-11-19 07:39:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:24,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740347962] [2022-11-19 07:39:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:24,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-19 07:39:24,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:24,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740347962] [2022-11-19 07:39:24,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740347962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:24,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:24,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331096482] [2022-11-19 07:39:24,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:24,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:24,705 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-19 07:39:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:24,848 INFO L93 Difference]: Finished difference Result 1327 states and 1773 transitions. [2022-11-19 07:39:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:24,849 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-19 07:39:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:24,855 INFO L225 Difference]: With dead ends: 1327 [2022-11-19 07:39:24,855 INFO L226 Difference]: Without dead ends: 973 [2022-11-19 07:39:24,856 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-19 07:39:24,857 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 28 mSDsluCounter, 129 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-19 07:39:24,860 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-19 07:39:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-19 07:39:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 917. [2022-11-19 07:39:24,952 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-19 07:39:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1208 transitions. [2022-11-19 07:39:24,957 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1208 transitions. Word has length 60 [2022-11-19 07:39:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:24,957 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1208 transitions. [2022-11-19 07:39:24,958 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-19 07:39:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1208 transitions. [2022-11-19 07:39:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-19 07:39:24,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:24,961 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-19 07:39:24,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:39:24,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash -980507615, now seen corresponding path program 2 times [2022-11-19 07:39:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295663616] [2022-11-19 07:39:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:25,014 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-19 07:39:25,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:25,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295663616] [2022-11-19 07:39:25,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295663616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:25,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:25,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886004527] [2022-11-19 07:39:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:25,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:25,017 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-19 07:39:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:25,144 INFO L93 Difference]: Finished difference Result 1247 states and 1641 transitions. [2022-11-19 07:39:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:25,145 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-19 07:39:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:25,149 INFO L225 Difference]: With dead ends: 1247 [2022-11-19 07:39:25,149 INFO L226 Difference]: Without dead ends: 859 [2022-11-19 07:39:25,150 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-19 07:39:25,151 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 135 mSDsluCounter, 45 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-19 07:39:25,151 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-19 07:39:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-11-19 07:39:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 850. [2022-11-19 07:39:25,240 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-19 07:39:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1115 transitions. [2022-11-19 07:39:25,244 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1115 transitions. Word has length 61 [2022-11-19 07:39:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:25,245 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1115 transitions. [2022-11-19 07:39:25,245 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-19 07:39:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1115 transitions. [2022-11-19 07:39:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-19 07:39:25,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:25,247 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-19 07:39:25,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:39:25,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 717283250, now seen corresponding path program 1 times [2022-11-19 07:39:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:25,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291074106] [2022-11-19 07:39:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:25,304 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-19 07:39:25,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:25,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291074106] [2022-11-19 07:39:25,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291074106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:25,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:25,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:39:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451522288] [2022-11-19 07:39:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:25,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:25,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:25,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:39:25,307 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-19 07:39:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:25,420 INFO L93 Difference]: Finished difference Result 977 states and 1274 transitions. [2022-11-19 07:39:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:25,421 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-19 07:39:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:25,424 INFO L225 Difference]: With dead ends: 977 [2022-11-19 07:39:25,424 INFO L226 Difference]: Without dead ends: 443 [2022-11-19 07:39:25,427 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-19 07:39:25,428 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 27 mSDsluCounter, 118 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-19 07:39:25,429 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-19 07:39:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-19 07:39:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-19 07:39:25,485 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-19 07:39:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 598 transitions. [2022-11-19 07:39:25,488 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 598 transitions. Word has length 73 [2022-11-19 07:39:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:25,488 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 598 transitions. [2022-11-19 07:39:25,489 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-19 07:39:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 598 transitions. [2022-11-19 07:39:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:39:25,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:25,496 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-19 07:39:25,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:39:25,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2033305335, now seen corresponding path program 1 times [2022-11-19 07:39:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:25,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385892269] [2022-11-19 07:39:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:25,610 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-19 07:39:25,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:25,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385892269] [2022-11-19 07:39:25,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385892269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:25,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138432609] [2022-11-19 07:39:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:25,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:25,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:25,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:25,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:39:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:25,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:39:25,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:25,778 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-19 07:39:25,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:39:25,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138432609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:25,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:39:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-19 07:39:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324006301] [2022-11-19 07:39:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:25,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:39:25,782 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-19 07:39:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:25,865 INFO L93 Difference]: Finished difference Result 845 states and 1149 transitions. [2022-11-19 07:39:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:25,866 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-19 07:39:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:25,868 INFO L225 Difference]: With dead ends: 845 [2022-11-19 07:39:25,869 INFO L226 Difference]: Without dead ends: 522 [2022-11-19 07:39:25,870 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-19 07:39:25,871 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 14 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-19 07:39:25,871 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-19 07:39:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-19 07:39:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 507. [2022-11-19 07:39:25,930 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-19 07:39:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2022-11-19 07:39:25,933 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 87 [2022-11-19 07:39:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:25,934 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2022-11-19 07:39:25,934 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-19 07:39:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2022-11-19 07:39:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:39:25,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:25,937 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-19 07:39:25,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:26,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:26,142 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1371971544, now seen corresponding path program 1 times [2022-11-19 07:39:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:26,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058261185] [2022-11-19 07:39:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:26,216 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-19 07:39:26,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:26,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058261185] [2022-11-19 07:39:26,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058261185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:26,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111743339] [2022-11-19 07:39:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:26,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:26,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:39:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:26,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:39:26,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:26,405 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-19 07:39:26,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:39:26,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111743339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:26,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:39:26,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-19 07:39:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298461076] [2022-11-19 07:39:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:26,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:39:26,408 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-19 07:39:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:26,516 INFO L93 Difference]: Finished difference Result 973 states and 1276 transitions. [2022-11-19 07:39:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:26,517 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-19 07:39:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:26,520 INFO L225 Difference]: With dead ends: 973 [2022-11-19 07:39:26,520 INFO L226 Difference]: Without dead ends: 603 [2022-11-19 07:39:26,521 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-19 07:39:26,522 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 74 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-19 07:39:26,523 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-19 07:39:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-19 07:39:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 533. [2022-11-19 07:39:26,585 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-19 07:39:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 695 transitions. [2022-11-19 07:39:26,588 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 695 transitions. Word has length 87 [2022-11-19 07:39:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:26,589 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 695 transitions. [2022-11-19 07:39:26,589 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-19 07:39:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 695 transitions. [2022-11-19 07:39:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:39:26,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:26,592 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-19 07:39:26,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:26,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:26,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash -584056763, now seen corresponding path program 2 times [2022-11-19 07:39:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:26,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407162774] [2022-11-19 07:39:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:26,994 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-19 07:39:26,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:26,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407162774] [2022-11-19 07:39:26,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407162774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:26,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488313234] [2022-11-19 07:39:26,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:39:26,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:26,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:27,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:39:27,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:39:27,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:39:27,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:39:27,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:39:27,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:39:27,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488313234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:27,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:39:27,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-19 07:39:27,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527919993] [2022-11-19 07:39:27,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:27,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:39:27,140 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-19 07:39:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:27,302 INFO L93 Difference]: Finished difference Result 1036 states and 1393 transitions. [2022-11-19 07:39:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:27,303 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-19 07:39:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:27,307 INFO L225 Difference]: With dead ends: 1036 [2022-11-19 07:39:27,307 INFO L226 Difference]: Without dead ends: 640 [2022-11-19 07:39:27,310 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-19 07:39:27,311 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:27,312 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.1s Time] [2022-11-19 07:39:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-19 07:39:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2022-11-19 07:39:27,399 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-19 07:39:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 806 transitions. [2022-11-19 07:39:27,403 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 806 transitions. Word has length 87 [2022-11-19 07:39:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:27,403 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 806 transitions. [2022-11-19 07:39:27,403 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-19 07:39:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 806 transitions. [2022-11-19 07:39:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 07:39:27,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:27,405 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-19 07:39:27,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:27,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:39:27,611 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1856996029, now seen corresponding path program 1 times [2022-11-19 07:39:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:27,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038895201] [2022-11-19 07:39:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:27,763 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-19 07:39:27,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:27,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038895201] [2022-11-19 07:39:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038895201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:27,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99158176] [2022-11-19 07:39:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:27,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:27,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:27,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:27,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:39:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:27,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:39:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:27,919 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-19 07:39:27,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:39:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99158176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:27,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:39:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-19 07:39:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793291211] [2022-11-19 07:39:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:27,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:39:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:39:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:39:27,922 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-19 07:39:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:28,075 INFO L93 Difference]: Finished difference Result 1467 states and 1905 transitions. [2022-11-19 07:39:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:39:28,076 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-19 07:39:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:28,080 INFO L225 Difference]: With dead ends: 1467 [2022-11-19 07:39:28,080 INFO L226 Difference]: Without dead ends: 854 [2022-11-19 07:39:28,082 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-19 07:39:28,083 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 64 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-19 07:39:28,083 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-19 07:39:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-19 07:39:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 685. [2022-11-19 07:39:28,169 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-19 07:39:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 885 transitions. [2022-11-19 07:39:28,174 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 885 transitions. Word has length 88 [2022-11-19 07:39:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:28,174 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 885 transitions. [2022-11-19 07:39:28,174 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-19 07:39:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 885 transitions. [2022-11-19 07:39:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-19 07:39:28,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:28,177 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-19 07:39:28,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:28,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:39:28,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1002503226, now seen corresponding path program 1 times [2022-11-19 07:39:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:28,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807673180] [2022-11-19 07:39:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:28,549 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-19 07:39:28,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807673180] [2022-11-19 07:39:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807673180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:28,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:39:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:39:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356558379] [2022-11-19 07:39:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:28,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:39:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:39:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:39:28,552 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-19 07:39:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:28,864 INFO L93 Difference]: Finished difference Result 1656 states and 2112 transitions. [2022-11-19 07:39:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:39:28,865 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-19 07:39:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:28,871 INFO L225 Difference]: With dead ends: 1656 [2022-11-19 07:39:28,871 INFO L226 Difference]: Without dead ends: 1169 [2022-11-19 07:39:28,873 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-19 07:39:28,873 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 131 mSDsluCounter, 99 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-19 07:39:28,874 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-19 07:39:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-11-19 07:39:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1131. [2022-11-19 07:39:29,026 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-19 07:39:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1431 transitions. [2022-11-19 07:39:29,031 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1431 transitions. Word has length 89 [2022-11-19 07:39:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:29,032 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1431 transitions. [2022-11-19 07:39:29,032 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-19 07:39:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1431 transitions. [2022-11-19 07:39:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-19 07:39:29,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:29,034 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-19 07:39:29,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:39:29,035 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -513844346, now seen corresponding path program 1 times [2022-11-19 07:39:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:29,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384395811] [2022-11-19 07:39:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:29,206 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-19 07:39:29,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384395811] [2022-11-19 07:39:29,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384395811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529098261] [2022-11-19 07:39:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:29,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:29,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:29,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:29,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:39:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:29,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-19 07:39:29,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:29,436 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-19 07:39:29,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:39:29,672 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-19 07:39:29,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529098261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:39:29,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270053046] [2022-11-19 07:39:29,681 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-19 07:39:29,681 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:39:29,682 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:39:29,682 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:39:29,682 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:39:40,792 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 95 for LOIs [2022-11-19 07:39:40,815 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-19 07:39:40,820 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-19 07:39:40,857 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 64 for LOIs [2022-11-19 07:39:40,956 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-19 07:39:41,143 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-19 07:39:41,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:39:55,393 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-19 07:39:55,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:39:55,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:39:55,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2022-11-19 07:39:55,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299785817] [2022-11-19 07:39:55,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:39:55,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 07:39:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 07:39:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2998, Unknown=0, NotChecked=0, Total=3306 [2022-11-19 07:39:55,397 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-19 07:39:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:57,291 INFO L93 Difference]: Finished difference Result 2480 states and 3150 transitions. [2022-11-19 07:39:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-19 07:39:57,292 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-19 07:39:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:57,298 INFO L225 Difference]: With dead ends: 2480 [2022-11-19 07:39:57,298 INFO L226 Difference]: Without dead ends: 1349 [2022-11-19 07:39:57,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 269 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5156 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=951, Invalid=11481, Unknown=0, NotChecked=0, Total=12432 [2022-11-19 07:39:57,305 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 464 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:57,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1387 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-19 07:39:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-11-19 07:39:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 917. [2022-11-19 07:39:57,445 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-19 07:39:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1112 transitions. [2022-11-19 07:39:57,450 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1112 transitions. Word has length 98 [2022-11-19 07:39:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:57,450 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1112 transitions. [2022-11-19 07:39:57,450 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-19 07:39:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1112 transitions. [2022-11-19 07:39:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-19 07:39:57,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:57,454 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-19 07:39:57,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:57,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:39:57,660 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:57,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -820585036, now seen corresponding path program 1 times [2022-11-19 07:39:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:57,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290720079] [2022-11-19 07:39:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:58,366 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-19 07:39:58,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290720079] [2022-11-19 07:39:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290720079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016974033] [2022-11-19 07:39:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:58,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:58,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:58,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:39:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:58,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-19 07:39:58,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:58,806 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-19 07:39:58,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:39:59,498 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-19 07:39:59,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016974033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:39:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447769270] [2022-11-19 07:39:59,502 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-19 07:39:59,502 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:39:59,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:39:59,503 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:39:59,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:06,613 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2022-11-19 07:40:07,284 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-19 07:40:07,290 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-19 07:40:07,330 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 64 for LOIs [2022-11-19 07:40:07,411 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-19 07:40:07,668 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-19 07:40:08,047 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:23,480 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-19 07:40:23,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:23,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:40:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-19 07:40:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312456688] [2022-11-19 07:40:23,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:23,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 07:40:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 07:40:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=5586, Unknown=0, NotChecked=0, Total=6162 [2022-11-19 07:40:23,484 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-19 07:40:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:28,799 INFO L93 Difference]: Finished difference Result 1942 states and 2387 transitions. [2022-11-19 07:40:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-19 07:40:28,800 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-19 07:40:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:28,808 INFO L225 Difference]: With dead ends: 1942 [2022-11-19 07:40:28,808 INFO L226 Difference]: Without dead ends: 1300 [2022-11-19 07:40:28,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9934 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=3045, Invalid=22715, Unknown=0, NotChecked=0, Total=25760 [2022-11-19 07:40:28,818 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1881 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 1198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1198 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:28,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 450 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1198 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-19 07:40:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-19 07:40:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1129. [2022-11-19 07:40:29,011 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-19 07:40:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1351 transitions. [2022-11-19 07:40:29,015 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1351 transitions. Word has length 101 [2022-11-19 07:40:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:29,015 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1351 transitions. [2022-11-19 07:40:29,016 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-19 07:40:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1351 transitions. [2022-11-19 07:40:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-19 07:40:29,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:29,018 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-19 07:40:29,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:29,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:29,226 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 861626592, now seen corresponding path program 1 times [2022-11-19 07:40:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:29,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412693696] [2022-11-19 07:40:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:29,552 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-19 07:40:29,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:29,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412693696] [2022-11-19 07:40:29,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412693696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:29,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848206419] [2022-11-19 07:40:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:29,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:29,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:29,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:29,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:40:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:29,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 07:40:29,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:29,794 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-19 07:40:29,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:30,000 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-19 07:40:30,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848206419] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:30,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:30,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2022-11-19 07:40:30,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906999714] [2022-11-19 07:40:30,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:30,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:40:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:40:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:40:30,002 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-19 07:40:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:30,349 INFO L93 Difference]: Finished difference Result 2239 states and 2678 transitions. [2022-11-19 07:40:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:40:30,352 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-19 07:40:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:30,356 INFO L225 Difference]: With dead ends: 2239 [2022-11-19 07:40:30,357 INFO L226 Difference]: Without dead ends: 897 [2022-11-19 07:40:30,360 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-19 07:40:30,360 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 89 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:30,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 195 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:40:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-11-19 07:40:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 748. [2022-11-19 07:40:30,505 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-19 07:40:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 871 transitions. [2022-11-19 07:40:30,508 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 871 transitions. Word has length 102 [2022-11-19 07:40:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:30,508 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 871 transitions. [2022-11-19 07:40:30,509 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-19 07:40:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 871 transitions. [2022-11-19 07:40:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-19 07:40:30,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:30,512 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-19 07:40:30,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 07:40:30,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:30,718 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -984513642, now seen corresponding path program 1 times [2022-11-19 07:40:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:30,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775971132] [2022-11-19 07:40:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:31,032 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-19 07:40:31,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775971132] [2022-11-19 07:40:31,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775971132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4268815] [2022-11-19 07:40:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:31,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:31,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:31,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:40:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:31,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 07:40:31,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:31,319 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-19 07:40:31,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:31,628 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-19 07:40:31,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4268815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:31,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1347527646] [2022-11-19 07:40:31,632 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-19 07:40:31,632 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:31,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:31,633 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:31,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:40,625 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 151 for LOIs [2022-11-19 07:40:41,390 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 47 for LOIs [2022-11-19 07:40:41,397 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 155 for LOIs [2022-11-19 07:40:41,453 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 131 for LOIs [2022-11-19 07:40:42,255 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 47 for LOIs [2022-11-19 07:40:42,536 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 171 for LOIs [2022-11-19 07:40:43,068 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:58,668 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-19 07:40:58,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:58,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:40:58,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2022-11-19 07:40:58,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111148817] [2022-11-19 07:40:58,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:58,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:40:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:58,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:40:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3430, Unknown=0, NotChecked=0, Total=3782 [2022-11-19 07:40:58,672 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-19 07:40:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:59,363 INFO L93 Difference]: Finished difference Result 900 states and 1040 transitions. [2022-11-19 07:40:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 07:40:59,363 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-19 07:40:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:59,364 INFO L225 Difference]: With dead ends: 900 [2022-11-19 07:40:59,364 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:40:59,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 409 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=574, Invalid=6398, Unknown=0, NotChecked=0, Total=6972 [2022-11-19 07:40:59,368 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 189 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:59,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 679 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:40:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:40:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:40:59,369 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-19 07:40:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:40:59,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2022-11-19 07:40:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:59,370 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:40:59,370 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-19 07:40:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:40:59,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:40:59,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-19 07:40:59,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-19 07:40:59,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:59,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 07:40:59,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:41:17,170 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2022-11-19 07:41:17,171 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-19 07:41:17,171 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2022-11-19 07:41:17,172 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-19 07:41:17,172 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-11-19 07:41:17,172 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-11-19 07:41:17,172 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-11-19 07:41:17,172 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-11-19 07:41:17,173 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-11-19 07:41:17,173 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-19 07:41:17,173 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-11-19 07:41:17,173 INFO L902 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2022-11-19 07:41:17,173 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-11-19 07:41:17,174 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-19 07:41:17,174 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2022-11-19 07:41:17,175 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-19 07:41:17,175 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-11-19 07:41:17,175 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-11-19 07:41:17,175 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-11-19 07:41:17,176 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-11-19 07:41:17,176 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2022-11-19 07:41:17,177 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-19 07:41:17,177 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-11-19 07:41:17,178 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-19 07:41:17,178 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-11-19 07:41:17,178 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2022-11-19 07:41:17,178 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2022-11-19 07:41:17,178 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-19 07:41:17,179 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-19 07:41:17,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:41:17,179 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-11-19 07:41:17,179 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-11-19 07:41:17,180 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-11-19 07:41:17,180 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-11-19 07:41:17,180 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-11-19 07:41:17,180 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-11-19 07:41:17,180 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2022-11-19 07:41:17,180 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-19 07:41:17,181 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-19 07:41:17,181 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-19 07:41:17,181 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-11-19 07:41:17,181 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2022-11-19 07:41:17,182 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-19 07:41:17,182 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-19 07:41:17,182 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-11-19 07:41:17,182 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-11-19 07:41:17,183 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-11-19 07:41:17,183 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-19 07:41:17,183 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-11-19 07:41:17,183 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-19 07:41:17,184 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:41:17,184 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-19 07:41:17,184 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-11-19 07:41:17,184 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-11-19 07:41:17,184 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-11-19 07:41:17,185 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-19 07:41:17,185 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-19 07:41:17,186 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-19 07:41:17,186 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-19 07:41:17,186 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-11-19 07:41:17,186 INFO L895 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2022-11-19 07:41:17,186 INFO L895 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-11-19 07:41:17,186 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-11-19 07:41:17,187 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-19 07:41:17,187 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-19 07:41:17,187 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-11-19 07:41:17,188 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-19 07:41:17,188 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-19 07:41:17,188 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-19 07:41:17,189 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-19 07:41:17,189 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-11-19 07:41:17,189 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-19 07:41:17,189 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-19 07:41:17,190 INFO L899 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-11-19 07:41:17,190 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-11-19 07:41:17,190 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-11-19 07:41:17,190 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-11-19 07:41:17,190 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-11-19 07:41:17,191 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-19 07:41:17,191 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-11-19 07:41:17,191 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-11-19 07:41:17,191 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-19 07:41:17,191 INFO L902 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-11-19 07:41:17,192 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-19 07:41:17,192 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-19 07:41:17,192 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-19 07:41:17,192 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-11-19 07:41:17,192 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-11-19 07:41:17,193 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-19 07:41:17,193 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-19 07:41:17,193 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-19 07:41:17,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-11-19 07:41:17,194 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-19 07:41:17,194 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-11-19 07:41:17,194 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-19 07:41:17,195 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-19 07:41:17,195 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-19 07:41:17,195 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-11-19 07:41:17,195 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-19 07:41:17,196 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-19 07:41:17,196 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-19 07:41:17,196 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-11-19 07:41:17,196 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-19 07:41:17,196 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-11-19 07:41:17,197 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-19 07:41:17,197 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-11-19 07:41:17,197 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-19 07:41:17,197 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-11-19 07:41:17,198 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-19 07:41:17,198 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2022-11-19 07:41:17,198 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-11-19 07:41:17,198 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-19 07:41:17,198 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-19 07:41:17,198 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-19 07:41:17,199 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2022-11-19 07:41:17,199 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2022-11-19 07:41:17,199 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2022-11-19 07:41:17,199 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-19 07:41:17,202 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-19 07:41:17,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:41:17,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:41:17 BoogieIcfgContainer [2022-11-19 07:41:17,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:41:17,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:41:17,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:41:17,300 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:41:17,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:06" (3/4) ... [2022-11-19 07:41:17,303 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:41:17,309 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-19 07:41:17,309 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-11-19 07:41:17,309 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-19 07:41:17,309 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-19 07:41:17,309 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-19 07:41:17,310 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-19 07:41:17,310 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-19 07:41:17,310 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-19 07:41:17,310 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-19 07:41:17,334 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2022-11-19 07:41:17,336 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-19 07:41:17,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 07:41:17,338 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:41:17,362 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-19 07:41:17,364 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-19 07:41:17,365 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-19 07:41:17,365 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-19 07:41:17,367 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-19 07:41:17,414 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:41:17,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:41:17,415 INFO L158 Benchmark]: Toolchain (without parser) took 132655.86ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 96.1MB in the beginning and 383.5MB in the end (delta: -287.4MB). Peak memory consumption was 623.7MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,415 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:41:17,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.03ms. Allocated memory is still 130.0MB. Free memory was 96.1MB in the beginning and 100.9MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.07ms. Allocated memory is still 130.0MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,416 INFO L158 Benchmark]: Boogie Preprocessor took 46.06ms. Allocated memory is still 130.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,416 INFO L158 Benchmark]: RCFGBuilder took 954.36ms. Allocated memory is still 130.0MB. Free memory was 96.0MB in the beginning and 52.7MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,417 INFO L158 Benchmark]: TraceAbstraction took 130938.57ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 52.6MB in the beginning and 392.0MB in the end (delta: -339.4MB). Peak memory consumption was 590.7MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,417 INFO L158 Benchmark]: Witness Printer took 114.56ms. Allocated memory is still 1.0GB. Free memory was 392.0MB in the beginning and 383.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:41:17,419 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.25ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.03ms. Allocated memory is still 130.0MB. Free memory was 96.1MB in the beginning and 100.9MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.07ms. Allocated memory is still 130.0MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.06ms. Allocated memory is still 130.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 954.36ms. Allocated memory is still 130.0MB. Free memory was 96.0MB in the beginning and 52.7MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 130938.57ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 52.6MB in the beginning and 392.0MB in the end (delta: -339.4MB). Peak memory consumption was 590.7MB. Max. memory is 16.1GB. * Witness Printer took 114.56ms. Allocated memory is still 1.0GB. Free memory was 392.0MB in the beginning and 383.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 130.8s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4793 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4751 mSDsluCounter, 7019 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4192 mSDsCounter, 1842 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4872 IncrementalHoareTripleChecker+Invalid, 6714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1842 mSolverCounterUnsat, 2827 mSDtfsCounter, 4872 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, 60.1s 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-19 07:41:17,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3a74090-8561-422e-acd9-0ca1bbb4f491/bin/utaipan-I9t0OCRTmS/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