./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:18:53,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:18:53,674 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:18:53,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:18:53,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:18:53,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:18:53,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:18:53,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:18:53,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:18:53,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:18:53,706 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:18:53,707 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:18:53,707 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:18:53,708 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:18:53,708 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:18:53,709 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:18:53,709 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:18:53,710 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:18:53,710 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:18:53,711 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:18:53,712 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:18:53,715 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:18:53,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:18:53,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:18:53,717 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:18:53,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:18:53,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:18:53,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:18:53,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:18:53,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:18:53,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:18:53,735 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:18:53,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:18:53,736 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:18:53,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:18:53,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:18:53,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:18:53,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:18:53,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:18:53,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:18:53,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:18:53,738 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:18:53,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:18:53,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:18:53,739 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:18:53,739 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:18:53,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:18:53,739 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/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_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2023-12-02 08:18:53,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:18:53,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:18:53,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:18:53,983 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:18:53,983 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:18:53,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-12-02 08:18:56,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:18:56,981 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:18:56,981 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-12-02 08:18:56,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/data/3a427fedf/bcac219a9c804f3490675f25cc089ea7/FLAG200fb7c66 [2023-12-02 08:18:57,011 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/data/3a427fedf/bcac219a9c804f3490675f25cc089ea7 [2023-12-02 08:18:57,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:18:57,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:18:57,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:18:57,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:18:57,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:18:57,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d78bf9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57, skipping insertion in model container [2023-12-02 08:18:57,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,080 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:18:57,229 WARN L240 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_f2a802de-14b2-4c80-89b9-e7cde9e12e36/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2023-12-02 08:18:57,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:18:57,416 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:18:57,428 WARN L240 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_f2a802de-14b2-4c80-89b9-e7cde9e12e36/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2023-12-02 08:18:57,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:18:57,503 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 08:18:57,503 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 08:18:57,511 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:18:57,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57 WrapperNode [2023-12-02 08:18:57,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:18:57,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:18:57,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:18:57,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:18:57,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,562 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-12-02 08:18:57,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:18:57,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:18:57,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:18:57,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:18:57,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:18:57,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:18:57,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:18:57,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:18:57,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (1/1) ... [2023-12-02 08:18:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:18:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:18:57,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:18:57,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:18:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:18:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 08:18:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:18:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:18:57,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:18:57,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 08:18:57,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 08:18:57,674 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 08:18:57,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 08:18:57,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 08:18:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 08:18:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:18:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 08:18:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:18:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:18:57,677 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 08:18:57,825 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:18:57,827 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:18:58,075 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:18:58,246 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:18:58,246 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 08:18:58,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:58 BoogieIcfgContainer [2023-12-02 08:18:58,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:18:58,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:18:58,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:18:58,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:18:58,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:18:57" (1/3) ... [2023-12-02 08:18:58,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67208d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:58, skipping insertion in model container [2023-12-02 08:18:58,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:57" (2/3) ... [2023-12-02 08:18:58,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67208d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:58, skipping insertion in model container [2023-12-02 08:18:58,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:58" (3/3) ... [2023-12-02 08:18:58,257 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-12-02 08:18:58,266 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 08:18:58,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:18:58,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 08:18:58,277 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 08:18:58,324 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 08:18:58,354 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 41 transitions, 94 flow [2023-12-02 08:18:58,611 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4818 states, 4815 states have (on average 3.506542056074766) internal successors, (16884), 4817 states have internal predecessors, (16884), 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) [2023-12-02 08:18:58,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:18:58,637 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=LoopHeads, 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;@4f8571b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:18:58,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 08:18:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 4818 states, 4815 states have (on average 3.506542056074766) internal successors, (16884), 4817 states have internal predecessors, (16884), 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) [2023-12-02 08:18:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 08:18:58,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:18:58,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:18:58,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:18:58,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:18:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1640573537, now seen corresponding path program 1 times [2023-12-02 08:18:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:18:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904092783] [2023-12-02 08:18:58,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:18:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:18:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:18:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:18:59,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:18:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904092783] [2023-12-02 08:18:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904092783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:18:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:18:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:18:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095872632] [2023-12-02 08:18:59,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:18:59,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:18:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:18:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:18:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:18:59,140 INFO L87 Difference]: Start difference. First operand has 4818 states, 4815 states have (on average 3.506542056074766) internal successors, (16884), 4817 states have internal predecessors, (16884), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-12-02 08:18:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:18:59,318 INFO L93 Difference]: Finished difference Result 4279 states and 14784 transitions. [2023-12-02 08:18:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:18:59,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-02 08:18:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:18:59,374 INFO L225 Difference]: With dead ends: 4279 [2023-12-02 08:18:59,374 INFO L226 Difference]: Without dead ends: 4083 [2023-12-02 08:18:59,375 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 [2023-12-02 08:18:59,379 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:18:59,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:18:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2023-12-02 08:18:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4083. [2023-12-02 08:18:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4083 states, 4082 states have (on average 3.4674179323860854) internal successors, (14154), 4082 states have internal predecessors, (14154), 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) [2023-12-02 08:18:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 14154 transitions. [2023-12-02 08:18:59,599 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 14154 transitions. Word has length 8 [2023-12-02 08:18:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:18:59,600 INFO L495 AbstractCegarLoop]: Abstraction has 4083 states and 14154 transitions. [2023-12-02 08:18:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-12-02 08:18:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 14154 transitions. [2023-12-02 08:18:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 08:18:59,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:18:59,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:18:59,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:18:59,609 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)] === [2023-12-02 08:18:59,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:18:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1370394728, now seen corresponding path program 1 times [2023-12-02 08:18:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:18:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360034723] [2023-12-02 08:18:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:18:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:18:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:18:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:18:59,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:18:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360034723] [2023-12-02 08:18:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360034723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:18:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:18:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:18:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128625328] [2023-12-02 08:18:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:18:59,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:18:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:18:59,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:18:59,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:18:59,826 INFO L87 Difference]: Start difference. First operand 4083 states and 14154 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) [2023-12-02 08:18:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:18:59,963 INFO L93 Difference]: Finished difference Result 3299 states and 10577 transitions. [2023-12-02 08:18:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:18:59,964 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 [2023-12-02 08:18:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:18:59,991 INFO L225 Difference]: With dead ends: 3299 [2023-12-02 08:18:59,992 INFO L226 Difference]: Without dead ends: 2858 [2023-12-02 08:18:59,992 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 [2023-12-02 08:18:59,994 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 63 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:18:59,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2023-12-02 08:19:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2023-12-02 08:19:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2857 states have (on average 3.239061953097655) internal successors, (9254), 2857 states have internal predecessors, (9254), 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) [2023-12-02 08:19:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 9254 transitions. [2023-12-02 08:19:00,113 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 9254 transitions. Word has length 14 [2023-12-02 08:19:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:00,113 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 9254 transitions. [2023-12-02 08:19:00,114 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) [2023-12-02 08:19:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 9254 transitions. [2023-12-02 08:19:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 08:19:00,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:00,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:00,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:19:00,119 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)] === [2023-12-02 08:19:00,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:00,120 INFO L85 PathProgramCache]: Analyzing trace with hash -411069978, now seen corresponding path program 1 times [2023-12-02 08:19:00,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800364138] [2023-12-02 08:19:00,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:00,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:00,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800364138] [2023-12-02 08:19:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800364138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:19:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203159704] [2023-12-02 08:19:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:19:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:19:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:19:00,310 INFO L87 Difference]: Start difference. First operand 2858 states and 9254 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-12-02 08:19:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:00,460 INFO L93 Difference]: Finished difference Result 1794 states and 5412 transitions. [2023-12-02 08:19:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:19:00,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-02 08:19:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:00,475 INFO L225 Difference]: With dead ends: 1794 [2023-12-02 08:19:00,475 INFO L226 Difference]: Without dead ends: 1528 [2023-12-02 08:19:00,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:19:00,477 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:00,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 56 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2023-12-02 08:19:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2023-12-02 08:19:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 3.011787819253438) internal successors, (4599), 1527 states have internal predecessors, (4599), 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) [2023-12-02 08:19:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 4599 transitions. [2023-12-02 08:19:00,543 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 4599 transitions. Word has length 19 [2023-12-02 08:19:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:00,544 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 4599 transitions. [2023-12-02 08:19:00,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-12-02 08:19:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 4599 transitions. [2023-12-02 08:19:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:19:00,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:00,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:00,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:19:00,549 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)] === [2023-12-02 08:19:00,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1903059588, now seen corresponding path program 1 times [2023-12-02 08:19:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417414464] [2023-12-02 08:19:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:00,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417414464] [2023-12-02 08:19:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417414464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:00,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:00,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:19:00,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867357844] [2023-12-02 08:19:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:00,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:19:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:19:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:19:00,753 INFO L87 Difference]: Start difference. First operand 1528 states and 4599 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-12-02 08:19:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:00,900 INFO L93 Difference]: Finished difference Result 1128 states and 3387 transitions. [2023-12-02 08:19:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:19:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2023-12-02 08:19:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:00,908 INFO L225 Difference]: With dead ends: 1128 [2023-12-02 08:19:00,908 INFO L226 Difference]: Without dead ends: 1052 [2023-12-02 08:19:00,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:19:00,909 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 130 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:00,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 45 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-12-02 08:19:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2023-12-02 08:19:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.0171265461465273) internal successors, (3171), 1051 states have internal predecessors, (3171), 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) [2023-12-02 08:19:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3171 transitions. [2023-12-02 08:19:00,936 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3171 transitions. Word has length 24 [2023-12-02 08:19:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:00,937 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 3171 transitions. [2023-12-02 08:19:00,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-12-02 08:19:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3171 transitions. [2023-12-02 08:19:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:19:00,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:00,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:19:00,940 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)] === [2023-12-02 08:19:00,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1257745517, now seen corresponding path program 1 times [2023-12-02 08:19:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438111115] [2023-12-02 08:19:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:01,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438111115] [2023-12-02 08:19:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438111115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:19:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311222967] [2023-12-02 08:19:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:19:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:19:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:19:01,453 INFO L87 Difference]: Start difference. First operand 1052 states and 3171 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-12-02 08:19:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:01,739 INFO L93 Difference]: Finished difference Result 1622 states and 4870 transitions. [2023-12-02 08:19:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:19:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 31 [2023-12-02 08:19:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:01,749 INFO L225 Difference]: With dead ends: 1622 [2023-12-02 08:19:01,749 INFO L226 Difference]: Without dead ends: 1022 [2023-12-02 08:19:01,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-02 08:19:01,751 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:01,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 256 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:19:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2023-12-02 08:19:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2023-12-02 08:19:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 2.9755142017629774) internal successors, (3038), 1021 states have internal predecessors, (3038), 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) [2023-12-02 08:19:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3038 transitions. [2023-12-02 08:19:01,788 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3038 transitions. Word has length 31 [2023-12-02 08:19:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:01,788 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3038 transitions. [2023-12-02 08:19:01,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-12-02 08:19:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3038 transitions. [2023-12-02 08:19:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:19:01,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:01,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:19:01,793 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)] === [2023-12-02 08:19:01,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1005869159, now seen corresponding path program 2 times [2023-12-02 08:19:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495773320] [2023-12-02 08:19:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:02,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495773320] [2023-12-02 08:19:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495773320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:19:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837818265] [2023-12-02 08:19:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:02,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:19:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:02,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:19:02,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:19:02,079 INFO L87 Difference]: Start difference. First operand 1022 states and 3038 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2023-12-02 08:19:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:02,304 INFO L93 Difference]: Finished difference Result 1478 states and 4334 transitions. [2023-12-02 08:19:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:19:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2023-12-02 08:19:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:02,310 INFO L225 Difference]: With dead ends: 1478 [2023-12-02 08:19:02,310 INFO L226 Difference]: Without dead ends: 616 [2023-12-02 08:19:02,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:19:02,311 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:02,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-12-02 08:19:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 520. [2023-12-02 08:19:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 2.8304431599229285) internal successors, (1469), 519 states have internal predecessors, (1469), 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) [2023-12-02 08:19:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1469 transitions. [2023-12-02 08:19:02,330 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1469 transitions. Word has length 31 [2023-12-02 08:19:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:02,330 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1469 transitions. [2023-12-02 08:19:02,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2023-12-02 08:19:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1469 transitions. [2023-12-02 08:19:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:19:02,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:02,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:02,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:19:02,333 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)] === [2023-12-02 08:19:02,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash -996129487, now seen corresponding path program 3 times [2023-12-02 08:19:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100077071] [2023-12-02 08:19:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:02,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100077071] [2023-12-02 08:19:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100077071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:02,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:19:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811855376] [2023-12-02 08:19:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:02,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:19:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:19:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:19:02,594 INFO L87 Difference]: Start difference. First operand 520 states and 1469 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2023-12-02 08:19:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:02,728 INFO L93 Difference]: Finished difference Result 808 states and 2279 transitions. [2023-12-02 08:19:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:19:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2023-12-02 08:19:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:02,732 INFO L225 Difference]: With dead ends: 808 [2023-12-02 08:19:02,733 INFO L226 Difference]: Without dead ends: 430 [2023-12-02 08:19:02,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:19:02,734 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:02,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-02 08:19:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2023-12-02 08:19:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 2.7599067599067597) internal successors, (1184), 429 states have internal predecessors, (1184), 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) [2023-12-02 08:19:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1184 transitions. [2023-12-02 08:19:02,748 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1184 transitions. Word has length 31 [2023-12-02 08:19:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:02,749 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1184 transitions. [2023-12-02 08:19:02,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2023-12-02 08:19:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1184 transitions. [2023-12-02 08:19:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:19:02,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:02,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:02,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 08:19:02,752 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)] === [2023-12-02 08:19:02,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1445478225, now seen corresponding path program 4 times [2023-12-02 08:19:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:02,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352882806] [2023-12-02 08:19:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:19:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:19:03,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:19:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352882806] [2023-12-02 08:19:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352882806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:19:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:19:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:19:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241388312] [2023-12-02 08:19:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:19:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:19:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:19:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:19:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:19:03,366 INFO L87 Difference]: Start difference. First operand 430 states and 1184 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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) [2023-12-02 08:19:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:19:03,541 INFO L93 Difference]: Finished difference Result 566 states and 1540 transitions. [2023-12-02 08:19:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:19:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 31 [2023-12-02 08:19:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:19:03,544 INFO L225 Difference]: With dead ends: 566 [2023-12-02 08:19:03,544 INFO L226 Difference]: Without dead ends: 304 [2023-12-02 08:19:03,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-02 08:19:03,545 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:19:03,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:19:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-02 08:19:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-12-02 08:19:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.570957095709571) internal successors, (779), 303 states have internal predecessors, (779), 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) [2023-12-02 08:19:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 779 transitions. [2023-12-02 08:19:03,555 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 779 transitions. Word has length 31 [2023-12-02 08:19:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:19:03,556 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 779 transitions. [2023-12-02 08:19:03,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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) [2023-12-02 08:19:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 779 transitions. [2023-12-02 08:19:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:19:03,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:19:03,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:19:03,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 08:19:03,558 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)] === [2023-12-02 08:19:03,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:19:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1500872975, now seen corresponding path program 5 times [2023-12-02 08:19:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:19:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576893498] [2023-12-02 08:19:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:19:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:19:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:19:03,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 08:19:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:19:03,663 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 08:19:03,664 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 08:19:03,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-02 08:19:03,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-02 08:19:03,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-12-02 08:19:03,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-12-02 08:19:03,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-12-02 08:19:03,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-02 08:19:03,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 08:19:03,671 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-12-02 08:19:03,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 08:19:03,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 08:19:03,725 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 08:19:03,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 08:19:03,728 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 08:19:03,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:19:03 BasicIcfg [2023-12-02 08:19:03,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 08:19:03,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 08:19:03,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 08:19:03,752 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 08:19:03,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:58" (3/4) ... [2023-12-02 08:19:03,753 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 08:19:03,778 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 08:19:03,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 08:19:03,780 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 08:19:03,845 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 08:19:03,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 08:19:03,846 INFO L158 Benchmark]: Toolchain (without parser) took 6831.11ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 146.9MB in the beginning and 192.0MB in the end (delta: -45.1MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,847 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:19:03,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.30ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 127.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.32ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 124.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,848 INFO L158 Benchmark]: Boogie Preprocessor took 33.65ms. Allocated memory is still 178.3MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,848 INFO L158 Benchmark]: RCFGBuilder took 649.70ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 107.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,849 INFO L158 Benchmark]: TraceAbstraction took 5501.56ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 106.5MB in the beginning and 204.6MB in the end (delta: -98.2MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,849 INFO L158 Benchmark]: Witness Printer took 93.59ms. Allocated memory is still 270.5MB. Free memory was 204.6MB in the beginning and 192.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 08:19:03,851 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.30ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 127.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.32ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 124.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.65ms. Allocated memory is still 178.3MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.70ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 107.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5501.56ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 106.5MB in the beginning and 204.6MB in the end (delta: -98.2MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 93.59ms. Allocated memory is still 270.5MB. Free memory was 204.6MB in the beginning and 192.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=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, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 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 [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 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 [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 832 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 644 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 903 IncrementalHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 188 mSDtfsCounter, 903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4818occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 96 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2023-12-02 08:19:03,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2a802de-14b2-4c80-89b9-e7cde9e12e36/bin/utaipan-verify-nQ1chXbOIh/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