./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- 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:41:45,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:41:45,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:41:45,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:41:45,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:41:45,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:41:45,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:41:45,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:41:45,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:41:45,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:41:45,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:41:45,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:41:45,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:41:45,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:41:45,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:41:45,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:41:45,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:41:45,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:41:45,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:41:45,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:41:45,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:41:45,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:41:45,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:41:45,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:41:45,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:41:45,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:41:45,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:41:45,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:41:45,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:41:45,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:41:45,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:41:45,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:41:45,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:41:45,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:41:45,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:41:45,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:41:45,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:41:45,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:41:45,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:41:45,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:41:45,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:41:45,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:41:45,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:41:45,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:41:45,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:41:45,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:41:45,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:41:45,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:41:45,602 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:41:45,603 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:41:45,603 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:41:45,603 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:41:45,604 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:41:45,605 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:41:45,605 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:41:45,605 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:41:45,605 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:41:45,606 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:41:45,606 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:41:45,606 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:41:45,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:41:45,607 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:41:45,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:41:45,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:41:45,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:41:45,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:41:45,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:41:45,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:41:45,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:41:45,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:41:45,611 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:41:45,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:41:45,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:41:45,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:41:45,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:45,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:41:45,612 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:41:45,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:41:45,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:41:45,614 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:41:45,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:41:45,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:41:45,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:41:45,614 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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-11-19 07:41:45,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:41:45,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:41:45,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:41:45,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:41:45,937 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:41:45,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-19 07:41:46,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/data/6d385a7e4/7476fd945aa64673a9214d919867e55f/FLAGab92dd287 [2022-11-19 07:41:46,620 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:41:46,621 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-19 07:41:46,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/data/6d385a7e4/7476fd945aa64673a9214d919867e55f/FLAGab92dd287 [2022-11-19 07:41:46,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/data/6d385a7e4/7476fd945aa64673a9214d919867e55f [2022-11-19 07:41:46,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:41:46,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:41:46,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:46,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:41:46,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:41:46,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:46" (1/1) ... [2022-11-19 07:41:46,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73146474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46, skipping insertion in model container [2022-11-19 07:41:46,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:46" (1/1) ... [2022-11-19 07:41:46,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:41:46,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:41:47,198 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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-19 07:41:47,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:47,427 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:41:47,439 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_46fa86ef-c0f5-4021-9ef6-4670f00af8af/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-19 07:41:47,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:47,533 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:41:47,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47 WrapperNode [2022-11-19 07:41:47,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:47,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:47,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:41:47,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:41:47,543 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:41:47" (1/1) ... [2022-11-19 07:41:47,574 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:41:47" (1/1) ... [2022-11-19 07:41:47,609 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-19 07:41:47,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:47,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:41:47,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:41:47,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:41:47,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,664 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:41:47,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:41:47,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:41:47,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:41:47,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (1/1) ... [2022-11-19 07:41:47,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:41:47,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:41:47,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:41:47,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:41:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:41:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:41:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:41:47,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:41:47,751 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:41:47,942 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:41:47,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:41:48,343 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:41:48,529 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:41:48,529 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:41:48,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:48 BoogieIcfgContainer [2022-11-19 07:41:48,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:41:48,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:41:48,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:41:48,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:41:48,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:46" (1/3) ... [2022-11-19 07:41:48,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb0a741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:48, skipping insertion in model container [2022-11-19 07:41:48,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:47" (2/3) ... [2022-11-19 07:41:48,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb0a741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:48, skipping insertion in model container [2022-11-19 07:41:48,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:48" (3/3) ... [2022-11-19 07:41:48,549 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-19 07:41:48,560 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:41:48,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:41:48,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:41:48,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:41:48,659 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:41:48,705 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:41:48,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 241 flow [2022-11-19 07:41:48,735 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 241 flow [2022-11-19 07:41:48,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-19 07:41:48,791 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-19 07:41:48,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:41:48,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-19 07:41:48,798 INFO L119 LiptonReduction]: Number of co-enabled transitions 1944 [2022-11-19 07:41:53,854 INFO L134 LiptonReduction]: Checked pairs total: 4370 [2022-11-19 07:41:53,855 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-11-19 07:41:53,864 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-11-19 07:41:53,945 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 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:41:53,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:41:53,971 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;@2e664223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:41:53,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 07:41:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 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:41:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:41:53,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:53,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:53,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1135082592, now seen corresponding path program 1 times [2022-11-19 07:41:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:54,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892784794] [2022-11-19 07:41:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:54,508 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:41:54,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:54,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892784794] [2022-11-19 07:41:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892784794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:54,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:54,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:41:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883454141] [2022-11-19 07:41:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:54,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:41:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:54,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:41:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:41:54,553 INFO L87 Difference]: Start difference. First operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:41:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:54,671 INFO L93 Difference]: Finished difference Result 570 states and 1744 transitions. [2022-11-19 07:41:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:41:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2022-11-19 07:41:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:54,704 INFO L225 Difference]: With dead ends: 570 [2022-11-19 07:41:54,704 INFO L226 Difference]: Without dead ends: 550 [2022-11-19 07:41:54,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:41:54,710 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:54,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-19 07:41:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-11-19 07:41:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 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:41:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2022-11-19 07:41:54,795 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2022-11-19 07:41:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2022-11-19 07:41:54,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:41:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2022-11-19 07:41:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:41:54,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:54,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:54,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:41:54,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 970540964, now seen corresponding path program 1 times [2022-11-19 07:41:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:54,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951143302] [2022-11-19 07:41:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:55,132 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:41:55,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951143302] [2022-11-19 07:41:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951143302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:55,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:41:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605125462] [2022-11-19 07:41:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:41:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:41:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:41:55,136 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:41:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:55,279 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2022-11-19 07:41:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:41:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2022-11-19 07:41:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:55,285 INFO L225 Difference]: With dead ends: 630 [2022-11-19 07:41:55,285 INFO L226 Difference]: Without dead ends: 530 [2022-11-19 07:41:55,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:41:55,287 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:55,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 13 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-19 07:41:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-19 07:41:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.056710775047259) internal successors, (1617), 529 states have internal predecessors, (1617), 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:41:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2022-11-19 07:41:55,319 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2022-11-19 07:41:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:55,320 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2022-11-19 07:41:55,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:41:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2022-11-19 07:41:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:41:55,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:55,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:55,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:41:55,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1729067142, now seen corresponding path program 1 times [2022-11-19 07:41:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:55,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294578195] [2022-11-19 07:41:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:56,102 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:41:56,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294578195] [2022-11-19 07:41:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294578195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:41:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926699150] [2022-11-19 07:41:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:56,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:41:56,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:41:56,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:56,108 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:41:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:56,346 INFO L93 Difference]: Finished difference Result 608 states and 1786 transitions. [2022-11-19 07:41:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:41:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2022-11-19 07:41:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:56,351 INFO L225 Difference]: With dead ends: 608 [2022-11-19 07:41:56,352 INFO L226 Difference]: Without dead ends: 518 [2022-11-19 07:41:56,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:56,353 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:56,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 17 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-19 07:41:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2022-11-19 07:41:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 3.0425531914893615) internal successors, (1573), 517 states have internal predecessors, (1573), 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:41:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1573 transitions. [2022-11-19 07:41:56,376 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1573 transitions. Word has length 11 [2022-11-19 07:41:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:56,376 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 1573 transitions. [2022-11-19 07:41:56,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:41:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1573 transitions. [2022-11-19 07:41:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:41:56,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:56,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:56,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:41:56,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash -176928844, now seen corresponding path program 1 times [2022-11-19 07:41:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:56,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001245714] [2022-11-19 07:41:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:57,143 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:41:57,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:57,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001245714] [2022-11-19 07:41:57,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001245714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:57,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:57,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968177253] [2022-11-19 07:41:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:57,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:57,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:57,147 INFO L87 Difference]: Start difference. First operand 518 states and 1573 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:41:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:57,394 INFO L93 Difference]: Finished difference Result 570 states and 1680 transitions. [2022-11-19 07:41:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-11-19 07:41:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:57,398 INFO L225 Difference]: With dead ends: 570 [2022-11-19 07:41:57,398 INFO L226 Difference]: Without dead ends: 510 [2022-11-19 07:41:57,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:41:57,399 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:57,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-19 07:41:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-19 07:41:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 3.031434184675835) internal successors, (1543), 509 states have internal predecessors, (1543), 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:41:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1543 transitions. [2022-11-19 07:41:57,419 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1543 transitions. Word has length 12 [2022-11-19 07:41:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:57,419 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1543 transitions. [2022-11-19 07:41:57,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:41:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1543 transitions. [2022-11-19 07:41:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:41:57,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:57,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:57,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:41:57,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2061471212, now seen corresponding path program 1 times [2022-11-19 07:41:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887129422] [2022-11-19 07:41:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:58,257 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:41:58,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:58,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887129422] [2022-11-19 07:41:58,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887129422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:58,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:58,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:58,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991396813] [2022-11-19 07:41:58,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:58,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:58,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:58,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:58,261 INFO L87 Difference]: Start difference. First operand 510 states and 1543 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:41:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:58,422 INFO L93 Difference]: Finished difference Result 558 states and 1629 transitions. [2022-11-19 07:41:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:41:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2022-11-19 07:41:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:58,426 INFO L225 Difference]: With dead ends: 558 [2022-11-19 07:41:58,426 INFO L226 Difference]: Without dead ends: 486 [2022-11-19 07:41:58,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:58,430 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:58,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-19 07:41:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-11-19 07:41:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.0) internal successors, (1455), 485 states have internal predecessors, (1455), 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:41:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1455 transitions. [2022-11-19 07:41:58,456 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1455 transitions. Word has length 12 [2022-11-19 07:41:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:58,457 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1455 transitions. [2022-11-19 07:41:58,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:41:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1455 transitions. [2022-11-19 07:41:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:41:58,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:58,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:41:58,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1754241415, now seen corresponding path program 1 times [2022-11-19 07:41:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:58,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358211978] [2022-11-19 07:41:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:59,077 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:41:59,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:59,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358211978] [2022-11-19 07:41:59,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358211978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:59,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:59,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:41:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363680995] [2022-11-19 07:41:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:59,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:41:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:41:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:59,080 INFO L87 Difference]: Start difference. First operand 486 states and 1455 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:41:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:59,357 INFO L93 Difference]: Finished difference Result 578 states and 1684 transitions. [2022-11-19 07:41:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:41:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-11-19 07:41:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:59,361 INFO L225 Difference]: With dead ends: 578 [2022-11-19 07:41:59,361 INFO L226 Difference]: Without dead ends: 506 [2022-11-19 07:41:59,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:41:59,362 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:59,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 27 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-11-19 07:41:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2022-11-19 07:41:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 2.960079840319361) internal successors, (1483), 501 states have internal predecessors, (1483), 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:41:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1483 transitions. [2022-11-19 07:41:59,383 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1483 transitions. Word has length 13 [2022-11-19 07:41:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:59,384 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1483 transitions. [2022-11-19 07:41:59,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:41:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1483 transitions. [2022-11-19 07:41:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:41:59,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:59,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:59,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:41:59,386 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:41:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1769964315, now seen corresponding path program 1 times [2022-11-19 07:41:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169973318] [2022-11-19 07:41:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:00,288 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:42:00,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:00,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169973318] [2022-11-19 07:42:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169973318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:00,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:00,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:42:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868535277] [2022-11-19 07:42:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:00,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:42:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:42:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:42:00,291 INFO L87 Difference]: Start difference. First operand 502 states and 1483 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:42:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:00,583 INFO L93 Difference]: Finished difference Result 514 states and 1488 transitions. [2022-11-19 07:42:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:42:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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) Word has length 14 [2022-11-19 07:42:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:00,585 INFO L225 Difference]: With dead ends: 514 [2022-11-19 07:42:00,585 INFO L226 Difference]: Without dead ends: 482 [2022-11-19 07:42:00,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:42:00,586 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:00,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 27 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:42:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-19 07:42:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 422. [2022-11-19 07:42:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.9429928741092635) internal successors, (1239), 421 states have internal predecessors, (1239), 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:42:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1239 transitions. [2022-11-19 07:42:00,600 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1239 transitions. Word has length 14 [2022-11-19 07:42:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:00,600 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 1239 transitions. [2022-11-19 07:42:00,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:42:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1239 transitions. [2022-11-19 07:42:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:42:00,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:00,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:00,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:42:00,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1093274285, now seen corresponding path program 1 times [2022-11-19 07:42:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:00,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5622040] [2022-11-19 07:42:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:00,793 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:42:00,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5622040] [2022-11-19 07:42:00,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5622040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:00,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:00,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:42:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212754987] [2022-11-19 07:42:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:00,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:42:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:42:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:42:00,796 INFO L87 Difference]: Start difference. First operand 422 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:42:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:00,892 INFO L93 Difference]: Finished difference Result 406 states and 1058 transitions. [2022-11-19 07:42:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:42:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2022-11-19 07:42:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:00,894 INFO L225 Difference]: With dead ends: 406 [2022-11-19 07:42:00,894 INFO L226 Difference]: Without dead ends: 306 [2022-11-19 07:42:00,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:42:00,895 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:00,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-19 07:42:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-19 07:42:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.540983606557377) internal successors, (775), 305 states have internal predecessors, (775), 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:42:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 775 transitions. [2022-11-19 07:42:00,906 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 775 transitions. Word has length 14 [2022-11-19 07:42:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:00,906 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 775 transitions. [2022-11-19 07:42:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:42:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 775 transitions. [2022-11-19 07:42:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:42:00,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:00,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:00,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:42:00,908 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1945678878, now seen corresponding path program 1 times [2022-11-19 07:42:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:00,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428279661] [2022-11-19 07:42:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:01,124 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:42:01,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:01,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428279661] [2022-11-19 07:42:01,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428279661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:01,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:01,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:42:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173516421] [2022-11-19 07:42:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:42:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:42:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:01,127 INFO L87 Difference]: Start difference. First operand 306 states and 775 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:42:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:01,261 INFO L93 Difference]: Finished difference Result 244 states and 564 transitions. [2022-11-19 07:42:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:42:01,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2022-11-19 07:42:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:01,263 INFO L225 Difference]: With dead ends: 244 [2022-11-19 07:42:01,263 INFO L226 Difference]: Without dead ends: 192 [2022-11-19 07:42:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:01,264 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:01,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-19 07:42:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-19 07:42:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.2670157068062826) internal successors, (433), 191 states have internal predecessors, (433), 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:42:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 433 transitions. [2022-11-19 07:42:01,272 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 433 transitions. Word has length 15 [2022-11-19 07:42:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:01,273 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 433 transitions. [2022-11-19 07:42:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:42:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 433 transitions. [2022-11-19 07:42:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:42:01,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:01,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:01,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:42:01,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2099097785, now seen corresponding path program 1 times [2022-11-19 07:42:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:01,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553709675] [2022-11-19 07:42:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:01,760 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:42:01,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:01,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553709675] [2022-11-19 07:42:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553709675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:01,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:42:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195348112] [2022-11-19 07:42:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:01,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:42:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:42:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:42:01,762 INFO L87 Difference]: Start difference. First operand 192 states and 433 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:42:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:01,929 INFO L93 Difference]: Finished difference Result 279 states and 601 transitions. [2022-11-19 07:42:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:42:01,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2022-11-19 07:42:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:01,931 INFO L225 Difference]: With dead ends: 279 [2022-11-19 07:42:01,931 INFO L226 Difference]: Without dead ends: 194 [2022-11-19 07:42:01,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:01,932 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:01,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:42:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-19 07:42:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2022-11-19 07:42:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.111111111111111) internal successors, (399), 189 states have internal predecessors, (399), 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:42:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 399 transitions. [2022-11-19 07:42:01,938 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 399 transitions. Word has length 17 [2022-11-19 07:42:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:01,938 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 399 transitions. [2022-11-19 07:42:01,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:42:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 399 transitions. [2022-11-19 07:42:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:42:01,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:01,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:01,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:42:01,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1639819455, now seen corresponding path program 1 times [2022-11-19 07:42:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:01,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234318384] [2022-11-19 07:42:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:42:02,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:02,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234318384] [2022-11-19 07:42:02,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234318384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:02,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:02,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:42:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123825342] [2022-11-19 07:42:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:02,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:42:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:02,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:42:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:02,418 INFO L87 Difference]: Start difference. First operand 190 states and 399 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:42:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:02,768 INFO L93 Difference]: Finished difference Result 271 states and 548 transitions. [2022-11-19 07:42:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:42:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18 [2022-11-19 07:42:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:02,769 INFO L225 Difference]: With dead ends: 271 [2022-11-19 07:42:02,770 INFO L226 Difference]: Without dead ends: 129 [2022-11-19 07:42:02,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:42:02,770 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:02,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:42:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-19 07:42:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2022-11-19 07:42:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.9075630252100841) internal successors, (227), 119 states have internal predecessors, (227), 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:42:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 227 transitions. [2022-11-19 07:42:02,775 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 227 transitions. Word has length 18 [2022-11-19 07:42:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:02,776 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 227 transitions. [2022-11-19 07:42:02,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:42:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 227 transitions. [2022-11-19 07:42:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:42:02,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:02,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:02,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:42:02,777 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1207365120, now seen corresponding path program 1 times [2022-11-19 07:42:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:02,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603886718] [2022-11-19 07:42:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:03,057 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:42:03,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603886718] [2022-11-19 07:42:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603886718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:03,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:03,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:42:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907490064] [2022-11-19 07:42:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:03,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:42:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:42:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:42:03,060 INFO L87 Difference]: Start difference. First operand 120 states and 227 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:42:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:03,176 INFO L93 Difference]: Finished difference Result 98 states and 182 transitions. [2022-11-19 07:42:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:42:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 18 [2022-11-19 07:42:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:03,177 INFO L225 Difference]: With dead ends: 98 [2022-11-19 07:42:03,177 INFO L226 Difference]: Without dead ends: 48 [2022-11-19 07:42:03,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:42:03,178 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:03,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-19 07:42:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-19 07:42:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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:42:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2022-11-19 07:42:03,180 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2022-11-19 07:42:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:03,180 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2022-11-19 07:42:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:42:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2022-11-19 07:42:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:42:03,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:03,181 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] [2022-11-19 07:42:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:42:03,181 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1676368497, now seen corresponding path program 1 times [2022-11-19 07:42:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929397562] [2022-11-19 07:42:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:03,815 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:42:03,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929397562] [2022-11-19 07:42:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929397562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:42:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:42:03,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:42:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490659550] [2022-11-19 07:42:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:03,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:42:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:42:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:42:03,818 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:42:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:03,986 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2022-11-19 07:42:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:42:03,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) Word has length 21 [2022-11-19 07:42:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:03,987 INFO L225 Difference]: With dead ends: 63 [2022-11-19 07:42:03,987 INFO L226 Difference]: Without dead ends: 36 [2022-11-19 07:42:03,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:42:03,988 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:03,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:42:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-19 07:42:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-19 07:42:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 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:42:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2022-11-19 07:42:03,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2022-11-19 07:42:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:03,991 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2022-11-19 07:42:03,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:42:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2022-11-19 07:42:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:42:03,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:03,991 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] [2022-11-19 07:42:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:42:03,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:42:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1626064699, now seen corresponding path program 2 times [2022-11-19 07:42:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:03,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841652020] [2022-11-19 07:42:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:42:04,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:42:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:42:04,093 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:42:04,093 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:42:04,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-19 07:42:04,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-19 07:42:04,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-19 07:42:04,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-19 07:42:04,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-19 07:42:04,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-19 07:42:04,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:42:04,100 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:04,105 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:42:04,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:42:04,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:42:04 BasicIcfg [2022-11-19 07:42:04,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:42:04,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:42:04,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:42:04,165 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:42:04,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:48" (3/4) ... [2022-11-19 07:42:04,167 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:42:04,277 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:42:04,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:42:04,278 INFO L158 Benchmark]: Toolchain (without parser) took 17383.37ms. Allocated memory was 136.3MB in the beginning and 299.9MB in the end (delta: 163.6MB). Free memory was 101.1MB in the beginning and 190.3MB in the end (delta: -89.2MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,278 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 136.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:42:04,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.49ms. Allocated memory is still 136.3MB. Free memory was 101.0MB in the beginning and 100.6MB in the end (delta: 415.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.30ms. Allocated memory is still 136.3MB. Free memory was 100.6MB in the beginning and 97.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,279 INFO L158 Benchmark]: Boogie Preprocessor took 62.25ms. Allocated memory is still 136.3MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,279 INFO L158 Benchmark]: RCFGBuilder took 858.47ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 64.9MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,280 INFO L158 Benchmark]: TraceAbstraction took 15629.47ms. Allocated memory was 136.3MB in the beginning and 299.9MB in the end (delta: 163.6MB). Free memory was 63.8MB in the beginning and 200.8MB in the end (delta: -137.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,280 INFO L158 Benchmark]: Witness Printer took 112.89ms. Allocated memory is still 299.9MB. Free memory was 199.8MB in the beginning and 190.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:42:04,282 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 136.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.49ms. Allocated memory is still 136.3MB. Free memory was 101.0MB in the beginning and 100.6MB in the end (delta: 415.6kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.30ms. Allocated memory is still 136.3MB. Free memory was 100.6MB in the beginning and 97.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.25ms. Allocated memory is still 136.3MB. Free memory was 97.9MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 858.47ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 64.9MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15629.47ms. Allocated memory was 136.3MB in the beginning and 299.9MB in the end (delta: 163.6MB). Free memory was 63.8MB in the beginning and 200.8MB in the end (delta: -137.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Witness Printer took 112.89ms. Allocated memory is still 299.9MB. Free memory was 199.8MB in the beginning and 190.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 121 PlacesBefore, 36 PlacesAfterwards, 113 TransitionsBefore, 27 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 4370 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2494, independent: 2364, independent conditional: 0, independent unconditional: 2364, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1410, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1410, independent: 1343, independent conditional: 0, independent unconditional: 1343, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 481, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 440, dependent conditional: 0, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2494, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 1410, unknown conditional: 0, unknown unconditional: 1410] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L730] 0 int y$w_buff0; [L732] 0 int y$w_buff1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$read_delayed; [L711] 0 int __unbuffered_p2_EAX = 0; [L709] 0 int __unbuffered_cnt = 0; [L718] 0 _Bool y$flush_delayed; [L733] 0 _Bool y$w_buff1_used; [L713] 0 _Bool main$tmp_guard1; [L712] 0 _Bool main$tmp_guard0; [L729] 0 int *y$read_delayed_var; [L731] 0 _Bool y$w_buff0_used; [L715] 0 int x = 0; [L724] 0 _Bool y$r_buff1_thd0; [L717] 0 int y = 0; [L726] 0 _Bool y$r_buff1_thd2; [L735] 0 int z = 0; [L725] 0 _Bool y$r_buff1_thd1; [L727] 0 _Bool y$r_buff1_thd3; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 458 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1336 IncrementalHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 75 mSDtfsCounter, 1336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=0, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-19 07:42:04,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fa86ef-c0f5-4021-9ef6-4670f00af8af/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE