./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:51:17,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:51:17,583 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:51:17,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:51:17,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:51:17,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:51:17,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:51:17,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:51:17,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:51:17,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:51:17,642 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:51:17,643 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:51:17,643 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:51:17,645 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:51:17,645 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:51:17,646 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:51:17,646 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:51:17,646 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:51:17,647 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:51:17,647 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:51:17,649 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:51:17,650 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:51:17,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:51:17,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:51:17,652 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:51:17,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:51:17,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:51:17,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:51:17,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:51:17,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:51:17,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:51:17,656 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:51:17,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:51:17,656 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:51:17,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:51:17,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:51:17,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:51:17,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:51:17,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:51:17,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:51:17,658 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:51:17,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:51:17,659 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:51:17,659 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:51:17,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:51:17,660 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_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-19 04:51:17,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:51:18,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:51:18,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:51:18,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:51:18,024 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:51:18,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-19 04:51:21,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:51:21,495 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:51:21,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-19 04:51:21,517 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/data/45094659d/1eebdd42271043bba71c50c2f9f38f0b/FLAGe60a5fe98 [2023-11-19 04:51:21,542 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/data/45094659d/1eebdd42271043bba71c50c2f9f38f0b [2023-11-19 04:51:21,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:51:21,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:51:21,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:51:21,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:51:21,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:51:21,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:21" (1/1) ... [2023-11-19 04:51:21,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f670d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:21, skipping insertion in model container [2023-11-19 04:51:21,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:21" (1/1) ... [2023-11-19 04:51:21,631 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:51:21,816 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_7664578a-e254-4a16-8df8-e53dce3c7e27/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2023-11-19 04:51:22,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:51:22,147 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:51:22,159 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_7664578a-e254-4a16-8df8-e53dce3c7e27/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2023-11-19 04:51:22,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:51:22,300 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:51:22,300 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:51:22,308 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:51:22,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22 WrapperNode [2023-11-19 04:51:22,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:51:22,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:51:22,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:51:22,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:51:22,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,450 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-11-19 04:51:22,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:51:22,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:51:22,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:51:22,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:51:22,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:51:22,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:51:22,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:51:22,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:51:22,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (1/1) ... [2023-11-19 04:51:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:51:22,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:51:22,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:51:22,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:51:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:51:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:51:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:51:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:51:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:51:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:51:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:51:22,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:51:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:51:22,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:51:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:51:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:51:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:51:22,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:51:22,628 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:51:22,777 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:51:22,779 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:51:23,279 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:51:23,707 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:51:23,707 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:51:23,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:51:23 BoogieIcfgContainer [2023-11-19 04:51:23,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:51:23,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:51:23,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:51:23,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:51:23,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:51:21" (1/3) ... [2023-11-19 04:51:23,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7271dbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:51:23, skipping insertion in model container [2023-11-19 04:51:23,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:22" (2/3) ... [2023-11-19 04:51:23,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7271dbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:51:23, skipping insertion in model container [2023-11-19 04:51:23,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:51:23" (3/3) ... [2023-11-19 04:51:23,725 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-19 04:51:23,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:51:23,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:51:23,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 04:51:23,745 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:51:23,826 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:51:23,868 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:23,883 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 109 transitions, 226 flow [2023-11-19 04:51:23,886 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 109 transitions, 226 flow [2023-11-19 04:51:23,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 226 flow [2023-11-19 04:51:23,972 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-11-19 04:51:23,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:51:23,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-19 04:51:23,983 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-11-19 04:51:34,300 INFO L134 LiptonReduction]: Checked pairs total: 3540 [2023-11-19 04:51:34,301 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-11-19 04:51:34,310 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 50 flow [2023-11-19 04:51:34,340 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 149 states, 146 states have (on average 2.6301369863013697) internal successors, (384), 148 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:34,365 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;@56170506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:34,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 146 states have (on average 2.6301369863013697) internal successors, (384), 148 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-19 04:51:34,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:34,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-19 04:51:34,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:34,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash 23015496, now seen corresponding path program 1 times [2023-11-19 04:51:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974019752] [2023-11-19 04:51:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:34,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974019752] [2023-11-19 04:51:34,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974019752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:34,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:34,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609704166] [2023-11-19 04:51:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:34,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:51:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:51:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:34,866 INFO L87 Difference]: Start difference. First operand has 149 states, 146 states have (on average 2.6301369863013697) internal successors, (384), 148 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:34,979 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2023-11-19 04:51:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:51:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-11-19 04:51:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:34,994 INFO L225 Difference]: With dead ends: 122 [2023-11-19 04:51:34,994 INFO L226 Difference]: Without dead ends: 112 [2023-11-19 04:51:34,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:35,003 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:35,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-19 04:51:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-19 04:51:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.2972972972972974) internal successors, (255), 111 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2023-11-19 04:51:35,066 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 4 [2023-11-19 04:51:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:35,067 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2023-11-19 04:51:35,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2023-11-19 04:51:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:51:35,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:35,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:51:35,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:35,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1480837789, now seen corresponding path program 1 times [2023-11-19 04:51:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102122638] [2023-11-19 04:51:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:35,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102122638] [2023-11-19 04:51:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102122638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:35,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150096100] [2023-11-19 04:51:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:35,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:51:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:35,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:51:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:35,604 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:35,668 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2023-11-19 04:51:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:51:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 04:51:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:35,673 INFO L225 Difference]: With dead ends: 107 [2023-11-19 04:51:35,674 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 04:51:35,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:35,677 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:35,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 04:51:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-19 04:51:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.2735849056603774) internal successors, (241), 106 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2023-11-19 04:51:35,696 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 7 [2023-11-19 04:51:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:35,697 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2023-11-19 04:51:35,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2023-11-19 04:51:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:51:35,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:35,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:35,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:51:35,701 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:35,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1338621327, now seen corresponding path program 1 times [2023-11-19 04:51:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438520587] [2023-11-19 04:51:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:35,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438520587] [2023-11-19 04:51:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438520587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440304956] [2023-11-19 04:51:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:51:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:51:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:36,002 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:36,059 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2023-11-19 04:51:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:51:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:51:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:36,062 INFO L225 Difference]: With dead ends: 103 [2023-11-19 04:51:36,063 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 04:51:36,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:51:36,067 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:36,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 04:51:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-19 04:51:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.2549019607843137) internal successors, (230), 102 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2023-11-19 04:51:36,089 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2023-11-19 04:51:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:36,090 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2023-11-19 04:51:36,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2023-11-19 04:51:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:51:36,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:36,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:36,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:51:36,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:36,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1452518875, now seen corresponding path program 1 times [2023-11-19 04:51:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994918852] [2023-11-19 04:51:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:36,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994918852] [2023-11-19 04:51:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994918852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:51:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672090862] [2023-11-19 04:51:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:51:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:51:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:51:36,374 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:36,469 INFO L93 Difference]: Finished difference Result 135 states and 294 transitions. [2023-11-19 04:51:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:51:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:51:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:36,470 INFO L225 Difference]: With dead ends: 135 [2023-11-19 04:51:36,470 INFO L226 Difference]: Without dead ends: 67 [2023-11-19 04:51:36,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:51:36,471 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:36,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-19 04:51:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-19 04:51:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.106060606060606) internal successors, (139), 66 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 139 transitions. [2023-11-19 04:51:36,476 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 139 transitions. Word has length 9 [2023-11-19 04:51:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:36,476 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 139 transitions. [2023-11-19 04:51:36,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 139 transitions. [2023-11-19 04:51:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:51:36,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:36,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:36,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:51:36,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:36,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2077865737, now seen corresponding path program 1 times [2023-11-19 04:51:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632779098] [2023-11-19 04:51:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:38,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632779098] [2023-11-19 04:51:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632779098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:38,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:51:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409613253] [2023-11-19 04:51:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:51:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:51:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:51:38,204 INFO L87 Difference]: Start difference. First operand 67 states and 139 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:38,359 INFO L93 Difference]: Finished difference Result 71 states and 146 transitions. [2023-11-19 04:51:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:51:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 04:51:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:38,362 INFO L225 Difference]: With dead ends: 71 [2023-11-19 04:51:38,362 INFO L226 Difference]: Without dead ends: 71 [2023-11-19 04:51:38,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:51:38,363 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:38,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-19 04:51:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-11-19 04:51:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2023-11-19 04:51:38,370 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 136 transitions. Word has length 10 [2023-11-19 04:51:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:38,370 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 136 transitions. [2023-11-19 04:51:38,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 136 transitions. [2023-11-19 04:51:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:51:38,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:38,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:51:38,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:38,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 10575112, now seen corresponding path program 1 times [2023-11-19 04:51:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521411442] [2023-11-19 04:51:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:39,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521411442] [2023-11-19 04:51:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521411442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:51:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37330423] [2023-11-19 04:51:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:51:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:51:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:51:39,466 INFO L87 Difference]: Start difference. First operand 67 states and 136 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:39,621 INFO L93 Difference]: Finished difference Result 70 states and 143 transitions. [2023-11-19 04:51:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:51:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:51:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:39,622 INFO L225 Difference]: With dead ends: 70 [2023-11-19 04:51:39,623 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 04:51:39,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:51:39,624 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:39,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 04:51:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2023-11-19 04:51:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 64 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 131 transitions. [2023-11-19 04:51:39,628 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 131 transitions. Word has length 11 [2023-11-19 04:51:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:39,628 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 131 transitions. [2023-11-19 04:51:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 131 transitions. [2023-11-19 04:51:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:51:39,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:39,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:39,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:51:39,630 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:39,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 293174431, now seen corresponding path program 1 times [2023-11-19 04:51:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:39,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947943846] [2023-11-19 04:51:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:41,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947943846] [2023-11-19 04:51:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947943846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:51:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367691853] [2023-11-19 04:51:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:41,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:51:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:51:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:51:41,057 INFO L87 Difference]: Start difference. First operand 65 states and 131 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:41,241 INFO L93 Difference]: Finished difference Result 71 states and 144 transitions. [2023-11-19 04:51:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:51:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:51:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:41,243 INFO L225 Difference]: With dead ends: 71 [2023-11-19 04:51:41,243 INFO L226 Difference]: Without dead ends: 71 [2023-11-19 04:51:41,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:51:41,244 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-19 04:51:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-11-19 04:51:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.073529411764706) internal successors, (141), 68 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 141 transitions. [2023-11-19 04:51:41,247 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 141 transitions. Word has length 12 [2023-11-19 04:51:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 141 transitions. [2023-11-19 04:51:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 141 transitions. [2023-11-19 04:51:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:51:41,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:41,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:51:41,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:41,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash 327741601, now seen corresponding path program 2 times [2023-11-19 04:51:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913481947] [2023-11-19 04:51:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:42,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913481947] [2023-11-19 04:51:42,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913481947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:51:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935515027] [2023-11-19 04:51:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:42,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:51:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:51:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:51:42,775 INFO L87 Difference]: Start difference. First operand 69 states and 141 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:42,944 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2023-11-19 04:51:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:51:42,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:51:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:42,945 INFO L225 Difference]: With dead ends: 72 [2023-11-19 04:51:42,945 INFO L226 Difference]: Without dead ends: 72 [2023-11-19 04:51:42,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:51:42,946 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:42,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-19 04:51:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-11-19 04:51:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.046153846153846) internal successors, (133), 65 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 133 transitions. [2023-11-19 04:51:42,950 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 133 transitions. Word has length 12 [2023-11-19 04:51:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:42,950 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 133 transitions. [2023-11-19 04:51:42,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 133 transitions. [2023-11-19 04:51:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:51:42,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:42,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:42,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:51:42,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:42,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 327734874, now seen corresponding path program 1 times [2023-11-19 04:51:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372514545] [2023-11-19 04:51:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:43,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372514545] [2023-11-19 04:51:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372514545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:51:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594406688] [2023-11-19 04:51:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:43,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:51:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:51:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:51:43,170 INFO L87 Difference]: Start difference. First operand 66 states and 133 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:43,257 INFO L93 Difference]: Finished difference Result 56 states and 95 transitions. [2023-11-19 04:51:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:51:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:51:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:43,259 INFO L225 Difference]: With dead ends: 56 [2023-11-19 04:51:43,259 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 04:51:43,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:51:43,260 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:43,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 04:51:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 04:51:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2023-11-19 04:51:43,262 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 12 [2023-11-19 04:51:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:43,263 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2023-11-19 04:51:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2023-11-19 04:51:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:51:43,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:43,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:43,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:51:43,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:43,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -947247703, now seen corresponding path program 1 times [2023-11-19 04:51:43,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623703780] [2023-11-19 04:51:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:43,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623703780] [2023-11-19 04:51:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623703780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:51:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030916309] [2023-11-19 04:51:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:43,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:51:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:51:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:51:43,483 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:43,569 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2023-11-19 04:51:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:51:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:51:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:43,570 INFO L225 Difference]: With dead ends: 31 [2023-11-19 04:51:43,570 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 04:51:43,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:51:43,571 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:43,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:51:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 04:51:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 04:51:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-19 04:51:43,573 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2023-11-19 04:51:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:43,574 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-19 04:51:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-19 04:51:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:51:43,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:43,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:51:43,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 04:51:43,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 674994931, now seen corresponding path program 1 times [2023-11-19 04:51:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597524054] [2023-11-19 04:51:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:43,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:43,769 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:43,770 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:43,771 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 04:51:43,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 04:51:43,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 04:51:43,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 04:51:43,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 04:51:43,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:51:43,776 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:43,782 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:51:43,782 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:51:43,827 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 04:51:43,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 04:51:43,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:51:43 BasicIcfg [2023-11-19 04:51:43,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:51:43,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:51:43,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:51:43,852 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:51:43,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:51:23" (3/4) ... [2023-11-19 04:51:43,854 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 04:51:43,878 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 04:51:43,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 04:51:43,965 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:51:43,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:51:43,966 INFO L158 Benchmark]: Toolchain (without parser) took 22408.65ms. Allocated memory was 165.7MB in the beginning and 390.1MB in the end (delta: 224.4MB). Free memory was 119.5MB in the beginning and 139.4MB in the end (delta: -19.9MB). Peak memory consumption was 206.3MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,967 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:51:43,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.16ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 95.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.73ms. Allocated memory is still 165.7MB. Free memory was 95.0MB in the beginning and 135.1MB in the end (delta: -40.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,968 INFO L158 Benchmark]: Boogie Preprocessor took 60.94ms. Allocated memory is still 165.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,968 INFO L158 Benchmark]: RCFGBuilder took 1200.77ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 121.3MB in the end (delta: 11.4MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,969 INFO L158 Benchmark]: TraceAbstraction took 20135.51ms. Allocated memory was 165.7MB in the beginning and 390.1MB in the end (delta: 224.4MB). Free memory was 120.1MB in the beginning and 149.9MB in the end (delta: -29.7MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,970 INFO L158 Benchmark]: Witness Printer took 113.34ms. Allocated memory is still 390.1MB. Free memory was 149.9MB in the beginning and 139.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 04:51:43,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 747.16ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 95.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.73ms. Allocated memory is still 165.7MB. Free memory was 95.0MB in the beginning and 135.1MB in the end (delta: -40.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.94ms. Allocated memory is still 165.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.77ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 121.3MB in the end (delta: 11.4MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20135.51ms. Allocated memory was 165.7MB in the beginning and 390.1MB in the end (delta: 224.4MB). Free memory was 120.1MB in the beginning and 149.9MB in the end (delta: -29.7MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. * Witness Printer took 113.34ms. Allocated memory is still 390.1MB. Free memory was 149.9MB in the beginning and 139.4MB in the end (delta: 10.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~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 113 PlacesBefore, 26 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 3540 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1815, independent: 1632, independent conditional: 0, independent unconditional: 1632, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1011, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1011, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 951, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 871, dependent conditional: 0, dependent unconditional: 871, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1815, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1011, unknown conditional: 0, unknown unconditional: 1011] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 126 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 11 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 04:51:44,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7664578a-e254-4a16-8df8-e53dce3c7e27/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE