./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ --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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:13:19,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:13:19,308 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:13:19,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:13:19,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:13:19,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:13:19,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:13:19,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:13:19,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:13:19,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:13:19,359 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:13:19,360 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:13:19,360 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:13:19,361 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:13:19,361 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:13:19,362 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:13:19,363 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:13:19,363 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:13:19,364 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:13:19,365 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:13:19,365 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:13:19,366 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:13:19,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:13:19,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:13:19,368 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:13:19,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:13:19,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:13:19,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:13:19,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:13:19,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:13:19,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:13:19,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:13:19,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:13:19,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:13:19,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:13:19,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:13:19,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:13:19,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:13:19,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:13:19,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:13:19,375 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:13:19,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:13:19,375 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:13:19,376 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:13:19,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:13:19,376 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_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/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_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2023-11-19 04:13:19,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:13:19,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:13:19,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:13:19,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:13:19,674 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:13:19,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-19 04:13:22,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:13:23,013 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:13:23,014 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-19 04:13:23,035 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/data/ef680a7c4/8325145574b64c4c889d35f6cef4ebd1/FLAG5dae6b069 [2023-11-19 04:13:23,068 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/data/ef680a7c4/8325145574b64c4c889d35f6cef4ebd1 [2023-11-19 04:13:23,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:13:23,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:13:23,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:13:23,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:13:23,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:13:23,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e175b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23, skipping insertion in model container [2023-11-19 04:13:23,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,188 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:13:23,457 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_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-11-19 04:13:23,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:13:23,804 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:13:23,819 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_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-11-19 04:13:23,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:13:23,904 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:13:23,904 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:13:23,913 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:13:23,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23 WrapperNode [2023-11-19 04:13:23,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:13:23,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:13:23,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:13:23,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:13:23,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,980 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-19 04:13:23,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:13:23,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:13:23,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:13:23,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:13:23,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:23,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:13:24,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:13:24,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:13:24,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:13:24,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (1/1) ... [2023-11-19 04:13:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:13:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:13:24,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:13:24,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:13:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:13:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:13:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:13:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:13:24,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:13:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:13:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:13:24,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:13:24,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:13:24,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:13:24,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:13:24,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:13:24,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:13:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:13:24,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:13:24,133 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:13:24,331 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:13:24,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:13:24,756 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:13:25,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:13:25,028 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:13:25,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:13:25 BoogieIcfgContainer [2023-11-19 04:13:25,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:13:25,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:13:25,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:13:25,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:13:25,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:13:23" (1/3) ... [2023-11-19 04:13:25,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755f9bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:13:25, skipping insertion in model container [2023-11-19 04:13:25,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:13:23" (2/3) ... [2023-11-19 04:13:25,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755f9bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:13:25, skipping insertion in model container [2023-11-19 04:13:25,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:13:25" (3/3) ... [2023-11-19 04:13:25,043 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-19 04:13:25,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:13:25,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:13:25,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 04:13:25,084 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:13:25,175 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:13:25,229 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:13:25,253 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 234 flow [2023-11-19 04:13:25,259 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 234 flow [2023-11-19 04:13:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 234 flow [2023-11-19 04:13:25,346 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-19 04:13:25,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:13:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-19 04:13:25,360 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2023-11-19 04:13:30,753 INFO L134 LiptonReduction]: Checked pairs total: 5312 [2023-11-19 04:13:30,754 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-19 04:13:30,762 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 64 flow [2023-11-19 04:13:30,855 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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-19 04:13:30,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:13:30,878 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;@3f02edb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:13:30,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 04:13:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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-19 04:13:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:13:30,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:30,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:13:30,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:30,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash 457065755, now seen corresponding path program 1 times [2023-11-19 04:13:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856392695] [2023-11-19 04:13:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:31,442 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-19 04:13:31,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856392695] [2023-11-19 04:13:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856392695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:13:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997970896] [2023-11-19 04:13:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:31,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:13:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:13:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:13:31,483 INFO L87 Difference]: Start difference. First operand has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-19 04:13:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:31,621 INFO L93 Difference]: Finished difference Result 470 states and 1409 transitions. [2023-11-19 04:13:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:13:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-19 04:13:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:31,641 INFO L225 Difference]: With dead ends: 470 [2023-11-19 04:13:31,642 INFO L226 Difference]: Without dead ends: 450 [2023-11-19 04:13:31,643 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-19 04:13:31,647 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:31,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-19 04:13:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2023-11-19 04:13:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 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-19 04:13:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2023-11-19 04:13:31,724 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2023-11-19 04:13:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:31,725 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2023-11-19 04:13:31,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-19 04:13:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2023-11-19 04:13:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:13:31,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:31,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:31,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:13:31,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:31,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 487927318, now seen corresponding path program 1 times [2023-11-19 04:13:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666607225] [2023-11-19 04:13:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:32,007 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-19 04:13:32,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666607225] [2023-11-19 04:13:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666607225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:13:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30099033] [2023-11-19 04:13:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:32,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:13:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:13:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:13:32,012 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 04:13:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:32,110 INFO L93 Difference]: Finished difference Result 698 states and 2014 transitions. [2023-11-19 04:13:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:13:32,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-11-19 04:13:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:32,119 INFO L225 Difference]: With dead ends: 698 [2023-11-19 04:13:32,119 INFO L226 Difference]: Without dead ends: 644 [2023-11-19 04:13:32,120 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-19 04:13:32,121 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:32,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-11-19 04:13:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 584. [2023-11-19 04:13:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 2.9639794168096056) internal successors, (1728), 583 states have internal predecessors, (1728), 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-19 04:13:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1728 transitions. [2023-11-19 04:13:32,178 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1728 transitions. Word has length 9 [2023-11-19 04:13:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:32,179 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1728 transitions. [2023-11-19 04:13:32,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 04:13:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1728 transitions. [2023-11-19 04:13:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:13:32,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:32,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:32,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:13:32,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:32,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1822491795, now seen corresponding path program 1 times [2023-11-19 04:13:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012880514] [2023-11-19 04:13:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:32,386 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-19 04:13:32,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012880514] [2023-11-19 04:13:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012880514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:13:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272793336] [2023-11-19 04:13:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:13:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:13:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:32,389 INFO L87 Difference]: Start difference. First operand 584 states and 1728 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:32,481 INFO L93 Difference]: Finished difference Result 617 states and 1780 transitions. [2023-11-19 04:13:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:13:32,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 04:13:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:32,488 INFO L225 Difference]: With dead ends: 617 [2023-11-19 04:13:32,489 INFO L226 Difference]: Without dead ends: 617 [2023-11-19 04:13:32,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:32,491 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:32,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-11-19 04:13:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 554. [2023-11-19 04:13:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 2.9367088607594938) internal successors, (1624), 553 states have internal predecessors, (1624), 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-19 04:13:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1624 transitions. [2023-11-19 04:13:32,525 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1624 transitions. Word has length 10 [2023-11-19 04:13:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:32,525 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1624 transitions. [2023-11-19 04:13:32,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1624 transitions. [2023-11-19 04:13:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:13:32,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:32,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:13:32,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:32,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash 705193057, now seen corresponding path program 1 times [2023-11-19 04:13:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:32,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487679012] [2023-11-19 04:13:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:32,691 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-19 04:13:32,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487679012] [2023-11-19 04:13:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487679012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:13:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909869058] [2023-11-19 04:13:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:13:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:13:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:32,694 INFO L87 Difference]: Start difference. First operand 554 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:32,803 INFO L93 Difference]: Finished difference Result 593 states and 1707 transitions. [2023-11-19 04:13:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:13:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:13:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:32,809 INFO L225 Difference]: With dead ends: 593 [2023-11-19 04:13:32,809 INFO L226 Difference]: Without dead ends: 593 [2023-11-19 04:13:32,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:32,814 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:32,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-19 04:13:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 512. [2023-11-19 04:13:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 2.9178082191780823) internal successors, (1491), 511 states have internal predecessors, (1491), 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-19 04:13:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1491 transitions. [2023-11-19 04:13:32,842 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1491 transitions. Word has length 11 [2023-11-19 04:13:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:32,844 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1491 transitions. [2023-11-19 04:13:32,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1491 transitions. [2023-11-19 04:13:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:13:32,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:32,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:32,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:13:32,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:32,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -973566050, now seen corresponding path program 1 times [2023-11-19 04:13:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:32,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032332047] [2023-11-19 04:13:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:33,049 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-19 04:13:33,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032332047] [2023-11-19 04:13:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032332047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:13:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293227758] [2023-11-19 04:13:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:33,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:13:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:13:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:13:33,056 INFO L87 Difference]: Start difference. First operand 512 states and 1491 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-19 04:13:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:33,215 INFO L93 Difference]: Finished difference Result 785 states and 2216 transitions. [2023-11-19 04:13:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:13:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-19 04:13:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:33,221 INFO L225 Difference]: With dead ends: 785 [2023-11-19 04:13:33,222 INFO L226 Difference]: Without dead ends: 449 [2023-11-19 04:13:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:13:33,224 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:33,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-19 04:13:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 413. [2023-11-19 04:13:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 2.883495145631068) internal successors, (1188), 412 states have internal predecessors, (1188), 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-19 04:13:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1188 transitions. [2023-11-19 04:13:33,251 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1188 transitions. Word has length 12 [2023-11-19 04:13:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:33,251 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 1188 transitions. [2023-11-19 04:13:33,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-19 04:13:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1188 transitions. [2023-11-19 04:13:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:13:33,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:33,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:13:33,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:33,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 384860894, now seen corresponding path program 2 times [2023-11-19 04:13:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:33,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039414461] [2023-11-19 04:13:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:33,513 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-19 04:13:33,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:33,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039414461] [2023-11-19 04:13:33,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039414461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:33,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:33,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:13:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762173456] [2023-11-19 04:13:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:33,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:13:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:13:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:33,516 INFO L87 Difference]: Start difference. First operand 413 states and 1188 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 04:13:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:33,636 INFO L93 Difference]: Finished difference Result 530 states and 1506 transitions. [2023-11-19 04:13:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:13:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 04:13:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:33,640 INFO L225 Difference]: With dead ends: 530 [2023-11-19 04:13:33,641 INFO L226 Difference]: Without dead ends: 281 [2023-11-19 04:13:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:13:33,642 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:33,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-19 04:13:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-19 04:13:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.825) internal successors, (791), 280 states have internal predecessors, (791), 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-19 04:13:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 791 transitions. [2023-11-19 04:13:33,658 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 791 transitions. Word has length 12 [2023-11-19 04:13:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:33,659 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 791 transitions. [2023-11-19 04:13:33,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 04:13:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 791 transitions. [2023-11-19 04:13:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:13:33,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:33,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:33,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:13:33,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:33,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1899934675, now seen corresponding path program 1 times [2023-11-19 04:13:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:33,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996396860] [2023-11-19 04:13:33,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:33,823 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-19 04:13:33,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996396860] [2023-11-19 04:13:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996396860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:13:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853954463] [2023-11-19 04:13:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:33,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:13:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:13:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:13:33,826 INFO L87 Difference]: Start difference. First operand 281 states and 791 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:33,900 INFO L93 Difference]: Finished difference Result 272 states and 761 transitions. [2023-11-19 04:13:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:13:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:13:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:33,904 INFO L225 Difference]: With dead ends: 272 [2023-11-19 04:13:33,904 INFO L226 Difference]: Without dead ends: 272 [2023-11-19 04:13:33,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 04:13:33,905 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:33,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-19 04:13:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2023-11-19 04:13:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.7868852459016393) internal successors, (680), 244 states have internal predecessors, (680), 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-19 04:13:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 680 transitions. [2023-11-19 04:13:33,919 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 680 transitions. Word has length 13 [2023-11-19 04:13:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:33,920 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 680 transitions. [2023-11-19 04:13:33,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 680 transitions. [2023-11-19 04:13:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:13:33,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:33,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:33,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:13:33,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:33,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1201322974, now seen corresponding path program 1 times [2023-11-19 04:13:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267397105] [2023-11-19 04:13:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:34,124 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-19 04:13:34,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267397105] [2023-11-19 04:13:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267397105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:13:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773159234] [2023-11-19 04:13:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:13:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:13:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:13:34,127 INFO L87 Difference]: Start difference. First operand 245 states and 680 transitions. Second operand has 5 states, 4 states have (on average 3.5) 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-19 04:13:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:34,307 INFO L93 Difference]: Finished difference Result 326 states and 896 transitions. [2023-11-19 04:13:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:13:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) 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-19 04:13:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:34,311 INFO L225 Difference]: With dead ends: 326 [2023-11-19 04:13:34,311 INFO L226 Difference]: Without dead ends: 173 [2023-11-19 04:13:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:13:34,312 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:34,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:13:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-19 04:13:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-11-19 04:13:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.627906976744186) internal successors, (452), 172 states have internal predecessors, (452), 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-19 04:13:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 452 transitions. [2023-11-19 04:13:34,323 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 452 transitions. Word has length 14 [2023-11-19 04:13:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:34,324 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 452 transitions. [2023-11-19 04:13:34,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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-19 04:13:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 452 transitions. [2023-11-19 04:13:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:13:34,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:34,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:34,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:13:34,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:34,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1191491944, now seen corresponding path program 2 times [2023-11-19 04:13:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:34,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109128696] [2023-11-19 04:13:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:34,506 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-19 04:13:34,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109128696] [2023-11-19 04:13:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109128696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:13:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534281819] [2023-11-19 04:13:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:34,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:13:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:13:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:13:34,509 INFO L87 Difference]: Start difference. First operand 173 states and 452 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:34,645 INFO L93 Difference]: Finished difference Result 173 states and 397 transitions. [2023-11-19 04:13:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:13:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 04:13:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:34,647 INFO L225 Difference]: With dead ends: 173 [2023-11-19 04:13:34,648 INFO L226 Difference]: Without dead ends: 129 [2023-11-19 04:13:34,648 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-19 04:13:34,649 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:34,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-19 04:13:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-19 04:13:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.28125) internal successors, (292), 128 states have internal predecessors, (292), 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-19 04:13:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 292 transitions. [2023-11-19 04:13:34,656 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 292 transitions. Word has length 14 [2023-11-19 04:13:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:34,656 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 292 transitions. [2023-11-19 04:13:34,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 292 transitions. [2023-11-19 04:13:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:13:34,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:34,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:34,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:13:34,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:34,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1346619704, now seen corresponding path program 1 times [2023-11-19 04:13:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028698744] [2023-11-19 04:13:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:34,855 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-19 04:13:34,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028698744] [2023-11-19 04:13:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028698744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:13:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432812555] [2023-11-19 04:13:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:34,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:13:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:13:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:13:34,861 INFO L87 Difference]: Start difference. First operand 129 states and 292 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-19 04:13:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:34,998 INFO L93 Difference]: Finished difference Result 107 states and 211 transitions. [2023-11-19 04:13:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:13:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-19 04:13:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:34,999 INFO L225 Difference]: With dead ends: 107 [2023-11-19 04:13:35,000 INFO L226 Difference]: Without dead ends: 81 [2023-11-19 04:13:35,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:13:35,001 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-19 04:13:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-19 04:13:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.9) internal successors, (152), 80 states have internal predecessors, (152), 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-19 04:13:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions. [2023-11-19 04:13:35,005 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 16 [2023-11-19 04:13:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:35,005 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 152 transitions. [2023-11-19 04:13:35,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-19 04:13:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions. [2023-11-19 04:13:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:13:35,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:35,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:35,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:13:35,007 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:35,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1394338118, now seen corresponding path program 1 times [2023-11-19 04:13:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032888868] [2023-11-19 04:13:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:35,290 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-19 04:13:35,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032888868] [2023-11-19 04:13:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032888868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:35,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:13:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094434382] [2023-11-19 04:13:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:13:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:13:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:13:35,292 INFO L87 Difference]: Start difference. First operand 81 states and 152 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:35,430 INFO L93 Difference]: Finished difference Result 69 states and 126 transitions. [2023-11-19 04:13:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:13:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 04:13:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:35,432 INFO L225 Difference]: With dead ends: 69 [2023-11-19 04:13:35,432 INFO L226 Difference]: Without dead ends: 61 [2023-11-19 04:13:35,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:13:35,433 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:35,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-19 04:13:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-19 04:13:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 60 states have internal predecessors, (112), 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-19 04:13:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2023-11-19 04:13:35,437 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 18 [2023-11-19 04:13:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:35,437 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2023-11-19 04:13:35,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:13:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2023-11-19 04:13:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:13:35,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:35,438 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] [2023-11-19 04:13:35,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:13:35,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:35,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 39827109, now seen corresponding path program 1 times [2023-11-19 04:13:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360839946] [2023-11-19 04:13:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:36,701 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-19 04:13:36,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360839946] [2023-11-19 04:13:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360839946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:13:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650338582] [2023-11-19 04:13:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:36,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:13:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:13:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:13:36,704 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-19 04:13:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:36,998 INFO L93 Difference]: Finished difference Result 83 states and 150 transitions. [2023-11-19 04:13:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:13:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2023-11-19 04:13:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:36,999 INFO L225 Difference]: With dead ends: 83 [2023-11-19 04:13:37,000 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 04:13:37,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-19 04:13:37,001 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:37,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 11 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:13:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 04:13:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-19 04:13:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.75) internal successors, (84), 48 states have internal predecessors, (84), 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-19 04:13:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 84 transitions. [2023-11-19 04:13:37,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 84 transitions. Word has length 20 [2023-11-19 04:13:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:37,005 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 84 transitions. [2023-11-19 04:13:37,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-19 04:13:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 84 transitions. [2023-11-19 04:13:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:13:37,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:37,006 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] [2023-11-19 04:13:37,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:13:37,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:37,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:37,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1399479387, now seen corresponding path program 2 times [2023-11-19 04:13:37,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337489951] [2023-11-19 04:13:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:37,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:13:37,809 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-19 04:13:37,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:13:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337489951] [2023-11-19 04:13:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337489951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:13:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:13:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:13:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511358703] [2023-11-19 04:13:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:13:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:13:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:13:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:13:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:13:37,812 INFO L87 Difference]: Start difference. First operand 49 states and 84 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-19 04:13:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:13:38,000 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2023-11-19 04:13:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:13:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2023-11-19 04:13:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:13:38,001 INFO L225 Difference]: With dead ends: 59 [2023-11-19 04:13:38,001 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 04:13:38,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-19 04:13:38,002 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:13:38,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:13:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 04:13:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 04:13:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 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-19 04:13:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2023-11-19 04:13:38,006 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2023-11-19 04:13:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:13:38,006 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2023-11-19 04:13:38,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-19 04:13:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2023-11-19 04:13:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:13:38,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:13:38,007 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] [2023-11-19 04:13:38,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:13:38,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:13:38,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:13:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash -545329755, now seen corresponding path program 3 times [2023-11-19 04:13:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:13:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824664380] [2023-11-19 04:13:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:13:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:13:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:13:38,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:13:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:13:38,209 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:13:38,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:13:38,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 04:13:38,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 04:13:38,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 04:13:38,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 04:13:38,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 04:13:38,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 04:13:38,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:13:38,217 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:13:38,225 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:13:38,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:13:38,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:13:38,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:13:38,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:13:38,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:13:38 BasicIcfg [2023-11-19 04:13:38,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:13:38,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:13:38,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:13:38,338 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:13:38,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:13:25" (3/4) ... [2023-11-19 04:13:38,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 04:13:38,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:13:38,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:13:38,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:13:38,429 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:13:38,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:13:38,430 INFO L158 Benchmark]: Toolchain (without parser) took 15351.98ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 143.8MB in the beginning and 209.8MB in the end (delta: -66.0MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,431 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 119.5MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:13:38,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.39ms. Allocated memory is still 172.0MB. Free memory was 143.8MB in the beginning and 120.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.66ms. Allocated memory is still 172.0MB. Free memory was 120.7MB in the beginning and 117.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,432 INFO L158 Benchmark]: Boogie Preprocessor took 45.25ms. Allocated memory is still 172.0MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,432 INFO L158 Benchmark]: RCFGBuilder took 1005.35ms. Allocated memory is still 172.0MB. Free memory was 115.8MB in the beginning and 135.9MB in the end (delta: -20.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,433 INFO L158 Benchmark]: TraceAbstraction took 13301.44ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 135.9MB in the beginning and 219.3MB in the end (delta: -83.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,433 INFO L158 Benchmark]: Witness Printer took 92.35ms. Allocated memory is still 302.0MB. Free memory was 219.3MB in the beginning and 209.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 04:13:38,435 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 119.5MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.39ms. Allocated memory is still 172.0MB. Free memory was 143.8MB in the beginning and 120.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.66ms. Allocated memory is still 172.0MB. Free memory was 120.7MB in the beginning and 117.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.25ms. Allocated memory is still 172.0MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1005.35ms. Allocated memory is still 172.0MB. Free memory was 115.8MB in the beginning and 135.9MB in the end (delta: -20.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13301.44ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 135.9MB in the beginning and 219.3MB in the end (delta: -83.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 92.35ms. Allocated memory is still 302.0MB. Free memory was 219.3MB in the beginning and 209.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 119 PlacesBefore, 35 PlacesAfterwards, 111 TransitionsBefore, 26 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 5312 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2538, independent: 2354, independent conditional: 0, independent unconditional: 2354, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1482, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1482, independent: 1404, independent conditional: 0, independent unconditional: 1404, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2538, independent: 924, independent conditional: 0, independent unconditional: 924, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1482, unknown conditional: 0, unknown unconditional: 1482] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 31 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=584occurred in iteration=2, InterpolantAutomatonStates: 65, 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, 13 MinimizatonAttempts, 267 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 04:13:38,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8912d32-f30d-4dc9-94b2-cc7a5cc56d93/bin/utaipan-verify-t7M7D8N6sZ/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