./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire --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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:31:44,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:31:44,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 20:31:44,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:31:44,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:31:44,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:31:44,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:31:44,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:31:44,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:31:44,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:31:44,580 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:31:44,580 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:31:44,581 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:31:44,581 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:31:44,582 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:31:44,583 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:31:44,583 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:31:44,584 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:31:44,584 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:31:44,585 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:31:44,585 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:31:44,586 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:31:44,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:31:44,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:31:44,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:31:44,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:31:44,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:31:44,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:31:44,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:31:44,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:31:44,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:31:44,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:31:44,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:31:44,603 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:31:44,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:31:44,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:31:44,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:31:44,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:31:44,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:31:44,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:31:44,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:31:44,606 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:31:44,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:31:44,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:31:44,607 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:31:44,607 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:31:44,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:31:44,607 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_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/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_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2023-11-23 20:31:44,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:31:44,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:31:44,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:31:44,938 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:31:44,939 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:31:44,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-23 20:31:48,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:31:48,643 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:31:48,644 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-23 20:31:48,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/data/b91678010/eb63424fa00c4c7490d04dacd9c3c261/FLAG9e0e049d0 [2023-11-23 20:31:48,692 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/data/b91678010/eb63424fa00c4c7490d04dacd9c3c261 [2023-11-23 20:31:48,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:31:48,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:31:48,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:31:48,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:31:48,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:31:48,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:31:48" (1/1) ... [2023-11-23 20:31:48,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102f8ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:48, skipping insertion in model container [2023-11-23 20:31:48,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:31:48" (1/1) ... [2023-11-23 20:31:48,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:31:49,100 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_11b2c817-252b-4d5e-8d6b-68048bb6d939/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-23 20:31:49,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:31:49,448 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:31:49,464 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_11b2c817-252b-4d5e-8d6b-68048bb6d939/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-23 20:31:49,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:31:49,634 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:31:49,635 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:31:49,645 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:31:49,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49 WrapperNode [2023-11-23 20:31:49,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:31:49,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:31:49,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:31:49,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:31:49,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,763 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-23 20:31:49,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:31:49,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:31:49,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:31:49,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:31:49,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:31:49,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:31:49,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:31:49,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:31:49,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (1/1) ... [2023-11-23 20:31:49,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:31:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:31:49,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:31:49,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:31:49,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:31:49,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 20:31:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:31:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:31:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:31:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 20:31:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 20:31:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 20:31:49,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 20:31:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:31:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 20:31:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:31:49,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:31:49,956 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 20:31:50,234 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:31:50,238 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:31:50,585 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:31:50,940 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:31:50,940 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:31:50,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:31:50 BoogieIcfgContainer [2023-11-23 20:31:50,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:31:50,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:31:50,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:31:50,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:31:50,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:31:48" (1/3) ... [2023-11-23 20:31:50,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6459b4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:31:50, skipping insertion in model container [2023-11-23 20:31:50,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:49" (2/3) ... [2023-11-23 20:31:50,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6459b4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:31:50, skipping insertion in model container [2023-11-23 20:31:50,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:31:50" (3/3) ... [2023-11-23 20:31:50,956 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-11-23 20:31:50,968 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 20:31:50,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:31:50,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 20:31:50,983 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 20:31:51,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 20:31:51,099 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 30 transitions, 68 flow [2023-11-23 20:31:51,226 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 562 states, 559 states have (on average 2.6404293381037567) internal successors, (1476), 561 states have internal predecessors, (1476), 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-11-23 20:31:51,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:31:51,261 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;@3300a076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:31:51,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-23 20:31:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 562 states, 559 states have (on average 2.6404293381037567) internal successors, (1476), 561 states have internal predecessors, (1476), 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-11-23 20:31:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 20:31:51,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:51,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 20:31:51,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:51,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 599246062, now seen corresponding path program 1 times [2023-11-23 20:31:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191479996] [2023-11-23 20:31:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:52,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191479996] [2023-11-23 20:31:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191479996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:31:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944464003] [2023-11-23 20:31:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:52,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:31:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:31:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:31:52,261 INFO L87 Difference]: Start difference. First operand has 562 states, 559 states have (on average 2.6404293381037567) internal successors, (1476), 561 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-23 20:31:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:52,451 INFO L93 Difference]: Finished difference Result 485 states and 1242 transitions. [2023-11-23 20:31:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:31:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-23 20:31:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:52,486 INFO L225 Difference]: With dead ends: 485 [2023-11-23 20:31:52,486 INFO L226 Difference]: Without dead ends: 457 [2023-11-23 20:31:52,489 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-11-23 20:31:52,495 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:52,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:31:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-11-23 20:31:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2023-11-23 20:31:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 2.5789473684210527) internal successors, (1176), 456 states have internal predecessors, (1176), 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-11-23 20:31:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1176 transitions. [2023-11-23 20:31:52,632 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1176 transitions. Word has length 6 [2023-11-23 20:31:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:52,635 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 1176 transitions. [2023-11-23 20:31:52,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-23 20:31:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1176 transitions. [2023-11-23 20:31:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 20:31:52,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:52,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:52,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:31:52,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:52,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1505375178, now seen corresponding path program 1 times [2023-11-23 20:31:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233891441] [2023-11-23 20:31:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:53,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233891441] [2023-11-23 20:31:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233891441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:31:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219133260] [2023-11-23 20:31:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:53,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:31:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:31:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:31:53,039 INFO L87 Difference]: Start difference. First operand 457 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:53,313 INFO L93 Difference]: Finished difference Result 531 states and 1327 transitions. [2023-11-23 20:31:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:31:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 20:31:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:53,341 INFO L225 Difference]: With dead ends: 531 [2023-11-23 20:31:53,341 INFO L226 Difference]: Without dead ends: 433 [2023-11-23 20:31:53,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:31:53,343 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:53,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 68 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-11-23 20:31:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2023-11-23 20:31:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.5555555555555554) internal successors, (1104), 432 states have internal predecessors, (1104), 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-11-23 20:31:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1104 transitions. [2023-11-23 20:31:53,405 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1104 transitions. Word has length 12 [2023-11-23 20:31:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:53,406 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1104 transitions. [2023-11-23 20:31:53,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1104 transitions. [2023-11-23 20:31:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:31:53,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:53,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:53,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:31:53,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:53,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1170375307, now seen corresponding path program 1 times [2023-11-23 20:31:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845256979] [2023-11-23 20:31:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:54,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845256979] [2023-11-23 20:31:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845256979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:54,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:31:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92833484] [2023-11-23 20:31:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:54,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:31:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:31:54,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:31:54,219 INFO L87 Difference]: Start difference. First operand 433 states and 1104 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-11-23 20:31:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:54,446 INFO L93 Difference]: Finished difference Result 495 states and 1233 transitions. [2023-11-23 20:31:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:31:54,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-11-23 20:31:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:54,452 INFO L225 Difference]: With dead ends: 495 [2023-11-23 20:31:54,452 INFO L226 Difference]: Without dead ends: 425 [2023-11-23 20:31:54,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:31:54,454 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:54,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-23 20:31:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2023-11-23 20:31:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 2.547169811320755) internal successors, (1080), 424 states have internal predecessors, (1080), 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-11-23 20:31:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1080 transitions. [2023-11-23 20:31:54,488 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1080 transitions. Word has length 14 [2023-11-23 20:31:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:54,488 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 1080 transitions. [2023-11-23 20:31:54,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-11-23 20:31:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1080 transitions. [2023-11-23 20:31:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:31:54,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:54,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:31:54,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:54,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1907561229, now seen corresponding path program 1 times [2023-11-23 20:31:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120987951] [2023-11-23 20:31:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:54,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120987951] [2023-11-23 20:31:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120987951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:54,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:31:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627226236] [2023-11-23 20:31:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:54,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:31:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:31:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:31:54,800 INFO L87 Difference]: Start difference. First operand 425 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:55,053 INFO L93 Difference]: Finished difference Result 669 states and 1639 transitions. [2023-11-23 20:31:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:31:55,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 20:31:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:55,059 INFO L225 Difference]: With dead ends: 669 [2023-11-23 20:31:55,060 INFO L226 Difference]: Without dead ends: 473 [2023-11-23 20:31:55,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:31:55,068 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:55,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 84 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-23 20:31:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 393. [2023-11-23 20:31:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 2.4668367346938775) internal successors, (967), 392 states have internal predecessors, (967), 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-11-23 20:31:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 967 transitions. [2023-11-23 20:31:55,094 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 967 transitions. Word has length 15 [2023-11-23 20:31:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:55,096 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 967 transitions. [2023-11-23 20:31:55,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 967 transitions. [2023-11-23 20:31:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:31:55,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:55,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:31:55,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:55,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -968801209, now seen corresponding path program 1 times [2023-11-23 20:31:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:55,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818109771] [2023-11-23 20:31:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:55,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:55,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818109771] [2023-11-23 20:31:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818109771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:31:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243605983] [2023-11-23 20:31:55,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:55,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 20:31:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 20:31:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:31:55,701 INFO L87 Difference]: Start difference. First operand 393 states and 967 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:55,971 INFO L93 Difference]: Finished difference Result 419 states and 1011 transitions. [2023-11-23 20:31:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:31:55,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 20:31:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:55,976 INFO L225 Difference]: With dead ends: 419 [2023-11-23 20:31:55,976 INFO L226 Difference]: Without dead ends: 363 [2023-11-23 20:31:55,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-23 20:31:55,977 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:55,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 93 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-23 20:31:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2023-11-23 20:31:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.441666666666667) internal successors, (879), 360 states have internal predecessors, (879), 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-11-23 20:31:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 879 transitions. [2023-11-23 20:31:55,993 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 879 transitions. Word has length 15 [2023-11-23 20:31:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:55,994 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 879 transitions. [2023-11-23 20:31:55,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 879 transitions. [2023-11-23 20:31:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:31:55,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:55,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:55,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:31:55,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:55,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 381781261, now seen corresponding path program 1 times [2023-11-23 20:31:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974454931] [2023-11-23 20:31:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:56,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974454931] [2023-11-23 20:31:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974454931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:56,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 20:31:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818767900] [2023-11-23 20:31:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:56,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 20:31:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 20:31:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:31:56,768 INFO L87 Difference]: Start difference. First operand 361 states and 879 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-11-23 20:31:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:57,134 INFO L93 Difference]: Finished difference Result 408 states and 972 transitions. [2023-11-23 20:31:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 20:31:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2023-11-23 20:31:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:57,138 INFO L225 Difference]: With dead ends: 408 [2023-11-23 20:31:57,138 INFO L226 Difference]: Without dead ends: 358 [2023-11-23 20:31:57,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-23 20:31:57,139 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 76 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:57,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 60 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-11-23 20:31:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2023-11-23 20:31:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.4173669467787113) internal successors, (863), 357 states have internal predecessors, (863), 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-11-23 20:31:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 863 transitions. [2023-11-23 20:31:57,158 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 863 transitions. Word has length 16 [2023-11-23 20:31:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:57,159 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 863 transitions. [2023-11-23 20:31:57,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-11-23 20:31:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 863 transitions. [2023-11-23 20:31:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:31:57,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:57,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:57,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:31:57,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:57,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2021798009, now seen corresponding path program 1 times [2023-11-23 20:31:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638032774] [2023-11-23 20:31:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:57,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638032774] [2023-11-23 20:31:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638032774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 20:31:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300767384] [2023-11-23 20:31:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 20:31:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 20:31:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:31:57,761 INFO L87 Difference]: Start difference. First operand 358 states and 863 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:58,029 INFO L93 Difference]: Finished difference Result 401 states and 951 transitions. [2023-11-23 20:31:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:31:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 20:31:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:58,033 INFO L225 Difference]: With dead ends: 401 [2023-11-23 20:31:58,034 INFO L226 Difference]: Without dead ends: 361 [2023-11-23 20:31:58,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-23 20:31:58,035 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:58,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 85 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:31:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-23 20:31:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2023-11-23 20:31:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.419718309859155) internal successors, (859), 355 states have internal predecessors, (859), 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-11-23 20:31:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 859 transitions. [2023-11-23 20:31:58,052 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 859 transitions. Word has length 17 [2023-11-23 20:31:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:58,052 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 859 transitions. [2023-11-23 20:31:58,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 859 transitions. [2023-11-23 20:31:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:31:58,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:58,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:31:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 20:31:58,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:58,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -386213217, now seen corresponding path program 2 times [2023-11-23 20:31:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292528920] [2023-11-23 20:31:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:58,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292528920] [2023-11-23 20:31:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292528920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:31:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444116789] [2023-11-23 20:31:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:31:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:31:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:31:58,316 INFO L87 Difference]: Start difference. First operand 356 states and 859 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:58,414 INFO L93 Difference]: Finished difference Result 299 states and 659 transitions. [2023-11-23 20:31:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:31:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 20:31:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:58,417 INFO L225 Difference]: With dead ends: 299 [2023-11-23 20:31:58,417 INFO L226 Difference]: Without dead ends: 250 [2023-11-23 20:31:58,418 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-11-23 20:31:58,420 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:58,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:31:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-23 20:31:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2023-11-23 20:31:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.2289156626506026) internal successors, (555), 249 states have internal predecessors, (555), 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-11-23 20:31:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 555 transitions. [2023-11-23 20:31:58,433 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 555 transitions. Word has length 17 [2023-11-23 20:31:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:58,434 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 555 transitions. [2023-11-23 20:31:58,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:31:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 555 transitions. [2023-11-23 20:31:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 20:31:58,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:58,436 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-11-23 20:31:58,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 20:31:58,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:58,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1056559243, now seen corresponding path program 1 times [2023-11-23 20:31:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:58,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46327939] [2023-11-23 20:31:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:31:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:31:58,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:31:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46327939] [2023-11-23 20:31:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46327939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:31:58,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:31:58,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:31:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071946563] [2023-11-23 20:31:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:31:58,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:31:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:31:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:31:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:31:58,725 INFO L87 Difference]: Start difference. First operand 250 states and 555 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-11-23 20:31:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:31:58,837 INFO L93 Difference]: Finished difference Result 166 states and 343 transitions. [2023-11-23 20:31:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:31:58,838 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-11-23 20:31:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:31:58,839 INFO L225 Difference]: With dead ends: 166 [2023-11-23 20:31:58,839 INFO L226 Difference]: Without dead ends: 102 [2023-11-23 20:31:58,840 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-11-23 20:31:58,841 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:31:58,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:31:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-23 20:31:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-23 20:31:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.0396039603960396) internal successors, (206), 101 states have internal predecessors, (206), 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-11-23 20:31:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 206 transitions. [2023-11-23 20:31:58,847 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 206 transitions. Word has length 19 [2023-11-23 20:31:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:31:58,848 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 206 transitions. [2023-11-23 20:31:58,848 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-11-23 20:31:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2023-11-23 20:31:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 20:31:58,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:31:58,849 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] [2023-11-23 20:31:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 20:31:58,850 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:31:58,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:31:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1880821720, now seen corresponding path program 1 times [2023-11-23 20:31:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:31:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018388583] [2023-11-23 20:31:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:31:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:31:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:00,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018388583] [2023-11-23 20:32:00,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018388583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:00,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:00,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 20:32:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84149170] [2023-11-23 20:32:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 20:32:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 20:32:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 20:32:00,442 INFO L87 Difference]: Start difference. First operand 102 states and 206 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-11-23 20:32:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:00,701 INFO L93 Difference]: Finished difference Result 146 states and 292 transitions. [2023-11-23 20:32:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:32:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2023-11-23 20:32:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:00,703 INFO L225 Difference]: With dead ends: 146 [2023-11-23 20:32:00,703 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 20:32:00,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-23 20:32:00,704 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:00,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 94 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:32:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 20:32:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-23 20:32:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.9397590361445782) internal successors, (161), 83 states have internal predecessors, (161), 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-11-23 20:32:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 161 transitions. [2023-11-23 20:32:00,710 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 161 transitions. Word has length 22 [2023-11-23 20:32:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:00,710 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 161 transitions. [2023-11-23 20:32:00,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-11-23 20:32:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 161 transitions. [2023-11-23 20:32:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 20:32:00,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:00,712 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] [2023-11-23 20:32:00,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 20:32:00,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 20:32:00,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1499527016, now seen corresponding path program 2 times [2023-11-23 20:32:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:00,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941949174] [2023-11-23 20:32:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:32:00,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 20:32:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:32:00,831 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 20:32:00,832 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 20:32:00,833 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-23 20:32:00,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-23 20:32:00,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-23 20:32:00,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-23 20:32:00,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-23 20:32:00,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 20:32:00,840 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:00,846 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 20:32:00,846 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 20:32:00,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-23 20:32:00,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 20:32:00,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:32:00 BasicIcfg [2023-11-23 20:32:00,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 20:32:00,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 20:32:00,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 20:32:00,921 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 20:32:00,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:31:50" (3/4) ... [2023-11-23 20:32:00,922 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 20:32:00,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-23 20:32:00,955 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 20:32:01,060 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/witness.graphml [2023-11-23 20:32:01,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 20:32:01,061 INFO L158 Benchmark]: Toolchain (without parser) took 12358.40ms. Allocated memory was 163.6MB in the beginning and 255.9MB in the end (delta: 92.3MB). Free memory was 131.9MB in the beginning and 111.1MB in the end (delta: 20.8MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,061 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:32:01,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 940.61ms. Allocated memory is still 163.6MB. Free memory was 131.9MB in the beginning and 108.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.72ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,062 INFO L158 Benchmark]: Boogie Preprocessor took 78.28ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,063 INFO L158 Benchmark]: RCFGBuilder took 1095.74ms. Allocated memory is still 163.6MB. Free memory was 103.9MB in the beginning and 94.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,064 INFO L158 Benchmark]: TraceAbstraction took 9974.89ms. Allocated memory was 163.6MB in the beginning and 255.9MB in the end (delta: 92.3MB). Free memory was 94.1MB in the beginning and 119.5MB in the end (delta: -25.4MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,064 INFO L158 Benchmark]: Witness Printer took 139.61ms. Allocated memory is still 255.9MB. Free memory was 119.5MB in the beginning and 111.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 20:32:01,066 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.29ms. Allocated memory is still 125.8MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 940.61ms. Allocated memory is still 163.6MB. Free memory was 131.9MB in the beginning and 108.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.72ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.28ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.74ms. Allocated memory is still 163.6MB. Free memory was 103.9MB in the beginning and 94.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9974.89ms. Allocated memory was 163.6MB in the beginning and 255.9MB in the end (delta: 92.3MB). Free memory was 94.1MB in the beginning and 119.5MB in the end (delta: -25.4MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Witness Printer took 139.61ms. Allocated memory is still 255.9MB. Free memory was 119.5MB in the beginning and 111.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 793]: 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: 791]: 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 5 procedures, 47 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 948 IncrementalHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 172 mSDtfsCounter, 948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 87 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-11-23 20:32:01,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b2c817-252b-4d5e-8d6b-68048bb6d939/bin/utaipan-verify-mE87zJ7Ire/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