./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91 --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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:19:53,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:19:53,289 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-24 23:19:53,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:19:53,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:19:53,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:19:53,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:19:53,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:19:53,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:19:53,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:19:53,345 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:19:53,346 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:19:53,346 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:19:53,348 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:19:53,348 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:19:53,349 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:19:53,349 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:19:53,350 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:19:53,350 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:19:53,351 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:19:53,351 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:19:53,352 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:19:53,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:19:53,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:19:53,354 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:19:53,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:19:53,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:19:53,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:19:53,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:19:53,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:19:53,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:19:53,358 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:19:53,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:19:53,358 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:19:53,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:19:53,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:19:53,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:19:53,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:19:53,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:19:53,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:19:53,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:19:53,361 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:19:53,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:19:53,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:19:53,362 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:19:53,362 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:19:53,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:19:53,363 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_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/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_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-24 23:19:53,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:19:53,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:19:53,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:19:53,726 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:19:53,726 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:19:53,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-24 23:19:56,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:19:57,320 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:19:57,320 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-24 23:19:57,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/data/51e1c2b5a/7e58bde2750f46edb95c354d2b05d67b/FLAG3ce460722 [2023-11-24 23:19:57,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/data/51e1c2b5a/7e58bde2750f46edb95c354d2b05d67b [2023-11-24 23:19:57,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:19:57,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:19:57,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:19:57,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:19:57,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:19:57,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:19:57" (1/1) ... [2023-11-24 23:19:57,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be23536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:57, skipping insertion in model container [2023-11-24 23:19:57,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:19:57" (1/1) ... [2023-11-24 23:19:57,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:19:57,735 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_4788eb79-3789-49c7-9ae6-90500c10e006/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-24 23:19:58,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:19:58,129 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:19:58,145 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_4788eb79-3789-49c7-9ae6-90500c10e006/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-24 23:19:58,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:19:58,272 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 23:19:58,272 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 23:19:58,280 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:19:58,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58 WrapperNode [2023-11-24 23:19:58,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:19:58,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:19:58,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:19:58,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:19:58,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,377 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-11-24 23:19:58,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:19:58,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:19:58,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:19:58,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:19:58,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:19:58,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:19:58,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:19:58,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:19:58,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (1/1) ... [2023-11-24 23:19:58,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:19:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:58,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:19:58,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:19:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:19:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 23:19:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:19:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:19:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:19:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 23:19:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 23:19:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 23:19:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 23:19:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 23:19:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 23:19:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:19:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 23:19:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:19:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:19:58,555 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:19:58,794 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:19:58,797 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:19:59,264 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:19:59,438 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:19:59,438 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 23:19:59,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:19:59 BoogieIcfgContainer [2023-11-24 23:19:59,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:19:59,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:19:59,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:19:59,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:19:59,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:19:57" (1/3) ... [2023-11-24 23:19:59,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36209be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:19:59, skipping insertion in model container [2023-11-24 23:19:59,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:58" (2/3) ... [2023-11-24 23:19:59,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36209be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:19:59, skipping insertion in model container [2023-11-24 23:19:59,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:19:59" (3/3) ... [2023-11-24 23:19:59,447 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-24 23:19:59,455 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:19:59,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:19:59,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 23:19:59,466 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:19:59,520 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 23:19:59,553 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2023-11-24 23:19:59,824 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 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-24 23:19:59,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:19:59,889 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;@6a0e7de9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:19:59,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 23:19:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 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-24 23:19:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 23:19:59,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:59,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 23:19:59,912 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-24 23:19:59,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1966912943, now seen corresponding path program 1 times [2023-11-24 23:19:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090272945] [2023-11-24 23:19:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:00,516 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-24 23:20:00,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090272945] [2023-11-24 23:20:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090272945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 23:20:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026793371] [2023-11-24 23:20:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:00,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:20:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:20:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:20:00,573 INFO L87 Difference]: Start difference. First operand has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:00,779 INFO L93 Difference]: Finished difference Result 3397 states and 11606 transitions. [2023-11-24 23:20:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:20:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-24 23:20:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:00,848 INFO L225 Difference]: With dead ends: 3397 [2023-11-24 23:20:00,848 INFO L226 Difference]: Without dead ends: 3201 [2023-11-24 23:20:00,850 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-24 23:20:00,854 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:00,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2023-11-24 23:20:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2023-11-24 23:20:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 3.43) internal successors, (10976), 3200 states have internal predecessors, (10976), 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-24 23:20:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 10976 transitions. [2023-11-24 23:20:01,215 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 10976 transitions. Word has length 6 [2023-11-24 23:20:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:01,216 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 10976 transitions. [2023-11-24 23:20:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 10976 transitions. [2023-11-24 23:20:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 23:20:01,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:01,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:01,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:20:01,234 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-24 23:20:01,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2075608294, now seen corresponding path program 1 times [2023-11-24 23:20:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398355825] [2023-11-24 23:20:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:01,712 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-24 23:20:01,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398355825] [2023-11-24 23:20:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398355825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:20:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8824631] [2023-11-24 23:20:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:20:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:20:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:20:01,717 INFO L87 Difference]: Start difference. First operand 3201 states and 10976 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-24 23:20:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:02,139 INFO L93 Difference]: Finished difference Result 3775 states and 12679 transitions. [2023-11-24 23:20:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:20:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-24 23:20:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:02,177 INFO L225 Difference]: With dead ends: 3775 [2023-11-24 23:20:02,178 INFO L226 Difference]: Without dead ends: 3089 [2023-11-24 23:20:02,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:20:02,187 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:02,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 104 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2023-11-24 23:20:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3089. [2023-11-24 23:20:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 3088 states have (on average 3.4145077720207255) internal successors, (10544), 3088 states have internal predecessors, (10544), 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-24 23:20:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 10544 transitions. [2023-11-24 23:20:02,372 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 10544 transitions. Word has length 14 [2023-11-24 23:20:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:02,374 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 10544 transitions. [2023-11-24 23:20:02,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-24 23:20:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 10544 transitions. [2023-11-24 23:20:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:20:02,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:02,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:02,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:20:02,380 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-24 23:20:02,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 368195483, now seen corresponding path program 1 times [2023-11-24 23:20:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104927153] [2023-11-24 23:20:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:02,655 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-24 23:20:02,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104927153] [2023-11-24 23:20:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104927153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:20:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513058893] [2023-11-24 23:20:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:02,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:20:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:20:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:20:02,658 INFO L87 Difference]: Start difference. First operand 3089 states and 10544 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:02,988 INFO L93 Difference]: Finished difference Result 3299 states and 11067 transitions. [2023-11-24 23:20:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:20:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:03,020 INFO L225 Difference]: With dead ends: 3299 [2023-11-24 23:20:03,020 INFO L226 Difference]: Without dead ends: 2809 [2023-11-24 23:20:03,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:03,022 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:03,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 119 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2023-11-24 23:20:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2023-11-24 23:20:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2808 states have (on average 3.3903133903133904) internal successors, (9520), 2808 states have internal predecessors, (9520), 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-24 23:20:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 9520 transitions. [2023-11-24 23:20:03,164 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 9520 transitions. Word has length 16 [2023-11-24 23:20:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:03,164 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 9520 transitions. [2023-11-24 23:20:03,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 9520 transitions. [2023-11-24 23:20:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:20:03,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:03,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:03,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:20:03,170 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-24 23:20:03,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1397277589, now seen corresponding path program 1 times [2023-11-24 23:20:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687443387] [2023-11-24 23:20:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:03,443 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-24 23:20:03,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687443387] [2023-11-24 23:20:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687443387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:03,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:20:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360419868] [2023-11-24 23:20:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:03,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:20:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:20:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:20:03,446 INFO L87 Difference]: Start difference. First operand 2809 states and 9520 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:03,765 INFO L93 Difference]: Finished difference Result 3579 states and 11951 transitions. [2023-11-24 23:20:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:20:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:03,783 INFO L225 Difference]: With dead ends: 3579 [2023-11-24 23:20:03,784 INFO L226 Difference]: Without dead ends: 1864 [2023-11-24 23:20:03,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-24 23:20:03,785 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:03,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 103 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2023-11-24 23:20:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2023-11-24 23:20:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 3.2549651100375736) internal successors, (6064), 1863 states have internal predecessors, (6064), 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-24 23:20:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 6064 transitions. [2023-11-24 23:20:03,859 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 6064 transitions. Word has length 16 [2023-11-24 23:20:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:03,860 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 6064 transitions. [2023-11-24 23:20:03,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-24 23:20:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 6064 transitions. [2023-11-24 23:20:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:20:03,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:03,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:03,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:20:03,865 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-24 23:20:03,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 231249760, now seen corresponding path program 1 times [2023-11-24 23:20:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580475795] [2023-11-24 23:20:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:04,123 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-24 23:20:04,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580475795] [2023-11-24 23:20:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580475795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:20:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885277431] [2023-11-24 23:20:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:04,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:20:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:20:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:20:04,126 INFO L87 Difference]: Start difference. First operand 1864 states and 6064 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:04,379 INFO L93 Difference]: Finished difference Result 1984 states and 6350 transitions. [2023-11-24 23:20:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:20:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-24 23:20:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:04,395 INFO L225 Difference]: With dead ends: 1984 [2023-11-24 23:20:04,396 INFO L226 Difference]: Without dead ends: 1704 [2023-11-24 23:20:04,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:04,397 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:04,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2023-11-24 23:20:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2023-11-24 23:20:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.2272460364063416) internal successors, (5496), 1703 states have internal predecessors, (5496), 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-24 23:20:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 5496 transitions. [2023-11-24 23:20:04,466 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 5496 transitions. Word has length 19 [2023-11-24 23:20:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:04,467 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 5496 transitions. [2023-11-24 23:20:04,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 5496 transitions. [2023-11-24 23:20:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 23:20:04,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:04,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:04,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:20:04,472 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-24 23:20:04,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1832008833, now seen corresponding path program 1 times [2023-11-24 23:20:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783345957] [2023-11-24 23:20:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:04,750 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-24 23:20:04,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783345957] [2023-11-24 23:20:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783345957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:04,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:20:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770639538] [2023-11-24 23:20:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:04,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:20:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:20:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:20:04,760 INFO L87 Difference]: Start difference. First operand 1704 states and 5496 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:05,040 INFO L93 Difference]: Finished difference Result 2224 states and 7122 transitions. [2023-11-24 23:20:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:20:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-24 23:20:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:05,051 INFO L225 Difference]: With dead ends: 2224 [2023-11-24 23:20:05,052 INFO L226 Difference]: Without dead ends: 1094 [2023-11-24 23:20:05,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-24 23:20:05,053 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:05,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-11-24 23:20:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2023-11-24 23:20:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 3.1399817017383347) internal successors, (3432), 1093 states have internal predecessors, (3432), 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-24 23:20:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 3432 transitions. [2023-11-24 23:20:05,105 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 3432 transitions. Word has length 21 [2023-11-24 23:20:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:05,105 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 3432 transitions. [2023-11-24 23:20:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 3432 transitions. [2023-11-24 23:20:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 23:20:05,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:05,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:20:05,112 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-24 23:20:05,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -894454206, now seen corresponding path program 1 times [2023-11-24 23:20:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059754680] [2023-11-24 23:20:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:05,293 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-24 23:20:05,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059754680] [2023-11-24 23:20:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059754680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:20:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763016727] [2023-11-24 23:20:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:20:05,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:20:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:20:05,300 INFO L87 Difference]: Start difference. First operand 1094 states and 3432 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:05,400 INFO L93 Difference]: Finished difference Result 1062 states and 3152 transitions. [2023-11-24 23:20:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:20:05,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-24 23:20:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:05,418 INFO L225 Difference]: With dead ends: 1062 [2023-11-24 23:20:05,423 INFO L226 Difference]: Without dead ends: 914 [2023-11-24 23:20:05,424 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-24 23:20:05,425 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:05,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-24 23:20:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2023-11-24 23:20:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 3.0295728368017523) internal successors, (2766), 913 states have internal predecessors, (2766), 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-24 23:20:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 2766 transitions. [2023-11-24 23:20:05,460 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 2766 transitions. Word has length 22 [2023-11-24 23:20:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:05,461 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 2766 transitions. [2023-11-24 23:20:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 2766 transitions. [2023-11-24 23:20:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 23:20:05,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:05,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:20:05,465 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-24 23:20:05,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1855851075, now seen corresponding path program 1 times [2023-11-24 23:20:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209658048] [2023-11-24 23:20:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:20:05,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209658048] [2023-11-24 23:20:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209658048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:20:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293111372] [2023-11-24 23:20:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:05,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:20:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:20:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:20:05,761 INFO L87 Difference]: Start difference. First operand 914 states and 2766 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:05,908 INFO L93 Difference]: Finished difference Result 710 states and 1994 transitions. [2023-11-24 23:20:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:20:05,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-24 23:20:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:05,914 INFO L225 Difference]: With dead ends: 710 [2023-11-24 23:20:05,914 INFO L226 Difference]: Without dead ends: 606 [2023-11-24 23:20:05,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:20:05,915 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:05,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-24 23:20:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2023-11-24 23:20:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.8198347107438018) internal successors, (1706), 605 states have internal predecessors, (1706), 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-24 23:20:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1706 transitions. [2023-11-24 23:20:05,937 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1706 transitions. Word has length 24 [2023-11-24 23:20:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1706 transitions. [2023-11-24 23:20:05,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:20:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1706 transitions. [2023-11-24 23:20:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 23:20:05,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:05,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:05,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 23:20:05,941 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-24 23:20:05,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 127519278, now seen corresponding path program 1 times [2023-11-24 23:20:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763074538] [2023-11-24 23:20:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:05,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:06,193 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-24 23:20:06,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763074538] [2023-11-24 23:20:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763074538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:06,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:20:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790551485] [2023-11-24 23:20:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:20:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:06,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:20:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:20:06,197 INFO L87 Difference]: Start difference. First operand 606 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-24 23:20:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:06,352 INFO L93 Difference]: Finished difference Result 430 states and 1166 transitions. [2023-11-24 23:20:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:20:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2023-11-24 23:20:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:06,356 INFO L225 Difference]: With dead ends: 430 [2023-11-24 23:20:06,356 INFO L226 Difference]: Without dead ends: 386 [2023-11-24 23:20:06,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:06,357 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:06,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-24 23:20:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-24 23:20:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.7168831168831167) internal successors, (1046), 385 states have internal predecessors, (1046), 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-24 23:20:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1046 transitions. [2023-11-24 23:20:06,375 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1046 transitions. Word has length 26 [2023-11-24 23:20:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:06,375 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1046 transitions. [2023-11-24 23:20:06,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-24 23:20:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1046 transitions. [2023-11-24 23:20:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 23:20:06,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:06,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:06,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 23:20:06,379 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-24 23:20:06,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash 586599021, now seen corresponding path program 1 times [2023-11-24 23:20:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902791146] [2023-11-24 23:20:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:07,921 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-24 23:20:07,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902791146] [2023-11-24 23:20:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902791146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 23:20:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329147917] [2023-11-24 23:20:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:07,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 23:20:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 23:20:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:07,924 INFO L87 Difference]: Start difference. First operand 386 states and 1046 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 23:20:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:08,284 INFO L93 Difference]: Finished difference Result 576 states and 1555 transitions. [2023-11-24 23:20:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:20:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2023-11-24 23:20:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:08,287 INFO L225 Difference]: With dead ends: 576 [2023-11-24 23:20:08,287 INFO L226 Difference]: Without dead ends: 320 [2023-11-24 23:20:08,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-24 23:20:08,288 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:08,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-24 23:20:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2023-11-24 23:20:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.6489028213166144) internal successors, (845), 319 states have internal predecessors, (845), 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-24 23:20:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 845 transitions. [2023-11-24 23:20:08,301 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 845 transitions. Word has length 29 [2023-11-24 23:20:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:08,302 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 845 transitions. [2023-11-24 23:20:08,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 23:20:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 845 transitions. [2023-11-24 23:20:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 23:20:08,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:08,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:20:08,304 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-24 23:20:08,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2121155855, now seen corresponding path program 2 times [2023-11-24 23:20:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029450423] [2023-11-24 23:20:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:09,552 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-24 23:20:09,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029450423] [2023-11-24 23:20:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029450423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:09,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:09,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 23:20:09,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992599163] [2023-11-24 23:20:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:09,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 23:20:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:09,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 23:20:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:09,556 INFO L87 Difference]: Start difference. First operand 320 states and 845 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 23:20:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:09,781 INFO L93 Difference]: Finished difference Result 432 states and 1131 transitions. [2023-11-24 23:20:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:20:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2023-11-24 23:20:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:09,784 INFO L225 Difference]: With dead ends: 432 [2023-11-24 23:20:09,784 INFO L226 Difference]: Without dead ends: 266 [2023-11-24 23:20:09,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-24 23:20:09,785 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:09,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 139 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-24 23:20:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-24 23:20:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.543396226415094) internal successors, (674), 265 states have internal predecessors, (674), 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-24 23:20:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 674 transitions. [2023-11-24 23:20:09,793 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 674 transitions. Word has length 29 [2023-11-24 23:20:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:09,794 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 674 transitions. [2023-11-24 23:20:09,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-24 23:20:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 674 transitions. [2023-11-24 23:20:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 23:20:09,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:09,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:09,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:20:09,796 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-24 23:20:09,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1329983059, now seen corresponding path program 3 times [2023-11-24 23:20:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333885993] [2023-11-24 23:20:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:20:09,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 23:20:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:20:09,949 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-24 23:20:09,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 23:20:09,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-24 23:20:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-24 23:20:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-24 23:20:09,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-24 23:20:09,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-24 23:20:09,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-24 23:20:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 23:20:09,957 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:09,962 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 23:20:09,962 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 23:20:10,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 23:20:10,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 23:20:10,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 23:20:10,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 11:20:10 BasicIcfg [2023-11-24 23:20:10,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 23:20:10,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 23:20:10,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 23:20:10,066 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 23:20:10,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:19:59" (3/4) ... [2023-11-24 23:20:10,067 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 23:20:10,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 23:20:10,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 23:20:10,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 23:20:10,156 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-24 23:20:10,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 23:20:10,157 INFO L158 Benchmark]: Toolchain (without parser) took 12778.48ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 144.1MB in the beginning and 89.9MB in the end (delta: 54.2MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,157 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:20:10,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 899.33ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 120.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.50ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 117.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,158 INFO L158 Benchmark]: Boogie Preprocessor took 44.59ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 116.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 23:20:10,158 INFO L158 Benchmark]: RCFGBuilder took 1014.52ms. Allocated memory is still 184.5MB. Free memory was 116.2MB in the beginning and 126.5MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,159 INFO L158 Benchmark]: TraceAbstraction took 10624.38ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 125.6MB in the beginning and 101.4MB in the end (delta: 24.2MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,159 INFO L158 Benchmark]: Witness Printer took 90.13ms. Allocated memory is still 274.7MB. Free memory was 101.4MB in the beginning and 89.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-24 23:20:10,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 899.33ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 120.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.50ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 117.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.59ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 116.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1014.52ms. Allocated memory is still 184.5MB. Free memory was 116.2MB in the beginning and 126.5MB in the end (delta: -10.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10624.38ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 125.6MB in the beginning and 101.4MB in the end (delta: 24.2MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. * Witness Printer took 90.13ms. Allocated memory is still 274.7MB. Free memory was 101.4MB in the beginning and 89.9MB in the end (delta: 11.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: 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; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((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, t2055={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, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((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, t2055={5:0}, t2056={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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 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, z=0] [L786] 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, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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, z=0] [L803] 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}, 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, z=0] [L806] 3 z = 1 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}, 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, z=1] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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=0, __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=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=1, z=1] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __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=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=1, z=1] - 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 928 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1247 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 248 mSDtfsCounter, 1247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3950occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-24 23:20:10,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4788eb79-3789-49c7-9ae6-90500c10e006/bin/utaipan-verify-SwPr7d2a91/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