./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:07:56,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:07:56,797 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:07:56,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:07:56,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:07:56,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:07:56,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:07:56,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:07:56,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:07:56,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:07:56,834 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:07:56,835 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:07:56,835 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:07:56,836 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:07:56,836 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:07:56,837 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:07:56,838 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:07:56,838 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:07:56,839 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:07:56,840 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:07:56,840 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:07:56,847 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:07:56,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:07:56,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:07:56,849 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:07:56,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:07:56,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:07:56,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:07:56,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:07:56,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:07:56,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:07:56,853 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:07:56,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:07:56,854 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:07:56,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:07:56,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:07:56,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:07:56,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:07:56,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:07:56,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:07:56,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:07:56,860 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:07:56,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:07:56,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:07:56,861 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:07:56,861 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:07:56,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:07:56,862 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_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2023-11-25 00:07:57,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:07:57,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:07:57,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:07:57,195 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:07:57,196 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:07:57,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-25 00:08:00,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:08:00,635 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:08:00,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-25 00:08:00,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/data/a327cef3d/b169cd70cce84136a6002ac97f44981a/FLAGfc66d6ba7 [2023-11-25 00:08:00,680 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/data/a327cef3d/b169cd70cce84136a6002ac97f44981a [2023-11-25 00:08:00,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:08:00,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:08:00,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:00,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:08:00,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:08:00,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:00" (1/1) ... [2023-11-25 00:08:00,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa5d85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:00, skipping insertion in model container [2023-11-25 00:08:00,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:00" (1/1) ... [2023-11-25 00:08:00,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:08:00,975 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_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-11-25 00:08:01,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:01,213 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:08:01,226 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_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-11-25 00:08:01,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:01,368 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:08:01,368 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:08:01,376 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:08:01,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01 WrapperNode [2023-11-25 00:08:01,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:01,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:01,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:08:01,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:08:01,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,473 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2023-11-25 00:08:01,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:01,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:08:01,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:08:01,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:08:01,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:08:01,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:08:01,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:08:01,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:08:01,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (1/1) ... [2023-11-25 00:08:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:08:01,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:01,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:08:01,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:08:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:08:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-25 00:08:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:08:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:08:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:08:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-25 00:08:01,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-25 00:08:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-25 00:08:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-25 00:08:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-25 00:08:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-25 00:08:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:08:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-25 00:08:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:08:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:08:01,645 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:08:01,932 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:08:01,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:08:02,374 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:08:02,724 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:08:02,725 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:08:02,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:02 BoogieIcfgContainer [2023-11-25 00:08:02,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:08:02,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:08:02,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:08:02,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:08:02,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:08:00" (1/3) ... [2023-11-25 00:08:02,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795123bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:02, skipping insertion in model container [2023-11-25 00:08:02,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:01" (2/3) ... [2023-11-25 00:08:02,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795123bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:02, skipping insertion in model container [2023-11-25 00:08:02,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:02" (3/3) ... [2023-11-25 00:08:02,740 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-25 00:08:02,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-25 00:08:02,761 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:08:02,761 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-25 00:08:02,761 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:08:02,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-25 00:08:02,861 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2023-11-25 00:08:03,146 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3796 states, 3793 states have (on average 3.4655945162140784) internal successors, (13145), 3795 states have internal predecessors, (13145), 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-25 00:08:03,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:08:03,179 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;@3e35e9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:08:03,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-25 00:08:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 3796 states, 3793 states have (on average 3.4655945162140784) internal successors, (13145), 3795 states have internal predecessors, (13145), 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-25 00:08:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-25 00:08:03,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:03,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-25 00:08:03,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:03,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1350816209, now seen corresponding path program 1 times [2023-11-25 00:08:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428774460] [2023-11-25 00:08:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:03,783 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-25 00:08:03,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428774460] [2023-11-25 00:08:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428774460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:03,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:08:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010060315] [2023-11-25 00:08:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:03,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:08:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:08:03,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:08:03,850 INFO L87 Difference]: Start difference. First operand has 3796 states, 3793 states have (on average 3.4655945162140784) internal successors, (13145), 3795 states have internal predecessors, (13145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:04,108 INFO L93 Difference]: Finished difference Result 3320 states and 11316 transitions. [2023-11-25 00:08:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:08:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-25 00:08:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:04,163 INFO L225 Difference]: With dead ends: 3320 [2023-11-25 00:08:04,163 INFO L226 Difference]: Without dead ends: 3152 [2023-11-25 00:08:04,164 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-25 00:08:04,168 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:04,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2023-11-25 00:08:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2023-11-25 00:08:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3151 states have (on average 3.4211361472548396) internal successors, (10780), 3151 states have internal predecessors, (10780), 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-25 00:08:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 10780 transitions. [2023-11-25 00:08:04,441 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 10780 transitions. Word has length 6 [2023-11-25 00:08:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:04,441 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 10780 transitions. [2023-11-25 00:08:04,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 10780 transitions. [2023-11-25 00:08:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-25 00:08:04,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:04,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:08:04,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:04,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1918168027, now seen corresponding path program 1 times [2023-11-25 00:08:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684837059] [2023-11-25 00:08:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:04,906 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-25 00:08:04,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684837059] [2023-11-25 00:08:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684837059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:08:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710369345] [2023-11-25 00:08:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:08:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:08:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:08:04,912 INFO L87 Difference]: Start difference. First operand 3152 states and 10780 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:05,348 INFO L93 Difference]: Finished difference Result 3680 states and 12324 transitions. [2023-11-25 00:08:05,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:08:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-25 00:08:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:05,384 INFO L225 Difference]: With dead ends: 3680 [2023-11-25 00:08:05,385 INFO L226 Difference]: Without dead ends: 3008 [2023-11-25 00:08:05,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:08:05,392 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:05,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 95 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:08:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2023-11-25 00:08:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2023-11-25 00:08:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 3.4013967409378116) internal successors, (10228), 3007 states have internal predecessors, (10228), 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-25 00:08:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 10228 transitions. [2023-11-25 00:08:05,575 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 10228 transitions. Word has length 14 [2023-11-25 00:08:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:05,576 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 10228 transitions. [2023-11-25 00:08:05,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 10228 transitions. [2023-11-25 00:08:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-25 00:08:05,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:05,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:05,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:08:05,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:05,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash 171928074, now seen corresponding path program 1 times [2023-11-25 00:08:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34717125] [2023-11-25 00:08:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:05,902 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-25 00:08:05,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34717125] [2023-11-25 00:08:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34717125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:05,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:08:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132753346] [2023-11-25 00:08:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:05,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:05,917 INFO L87 Difference]: Start difference. First operand 3008 states and 10228 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:06,340 INFO L93 Difference]: Finished difference Result 4048 states and 13450 transitions. [2023-11-25 00:08:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:08:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-25 00:08:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:06,360 INFO L225 Difference]: With dead ends: 4048 [2023-11-25 00:08:06,360 INFO L226 Difference]: Without dead ends: 1958 [2023-11-25 00:08:06,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-25 00:08:06,362 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 148 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:06,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 99 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:08:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2023-11-25 00:08:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1958. [2023-11-25 00:08:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1957 states have (on average 3.3009708737864076) internal successors, (6460), 1957 states have internal predecessors, (6460), 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-25 00:08:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 6460 transitions. [2023-11-25 00:08:06,442 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 6460 transitions. Word has length 16 [2023-11-25 00:08:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:06,442 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 6460 transitions. [2023-11-25 00:08:06,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 6460 transitions. [2023-11-25 00:08:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:08:06,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:06,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:06,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:08:06,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:06,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1204656651, now seen corresponding path program 1 times [2023-11-25 00:08:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75087592] [2023-11-25 00:08:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:06,699 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-25 00:08:06,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75087592] [2023-11-25 00:08:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75087592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:06,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:08:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041410234] [2023-11-25 00:08:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:06,701 INFO L87 Difference]: Start difference. First operand 1958 states and 6460 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:06,955 INFO L93 Difference]: Finished difference Result 2038 states and 6604 transitions. [2023-11-25 00:08:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:08:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-25 00:08:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:06,972 INFO L225 Difference]: With dead ends: 2038 [2023-11-25 00:08:06,972 INFO L226 Difference]: Without dead ends: 1718 [2023-11-25 00:08:06,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:08:06,973 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:06,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 96 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:08:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2023-11-25 00:08:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2023-11-25 00:08:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 3.266161910308678) internal successors, (5608), 1717 states have internal predecessors, (5608), 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-25 00:08:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 5608 transitions. [2023-11-25 00:08:07,043 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 5608 transitions. Word has length 18 [2023-11-25 00:08:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:07,043 INFO L495 AbstractCegarLoop]: Abstraction has 1718 states and 5608 transitions. [2023-11-25 00:08:07,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 5608 transitions. [2023-11-25 00:08:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:08:07,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:07,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:07,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:08:07,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:07,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 242584482, now seen corresponding path program 1 times [2023-11-25 00:08:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118280723] [2023-11-25 00:08:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:07,286 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-25 00:08:07,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118280723] [2023-11-25 00:08:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118280723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:08:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118737628] [2023-11-25 00:08:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:07,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:08:07,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:08:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:08:07,290 INFO L87 Difference]: Start difference. First operand 1718 states and 5608 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:07,416 INFO L93 Difference]: Finished difference Result 1650 states and 5064 transitions. [2023-11-25 00:08:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:08:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-25 00:08:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:07,429 INFO L225 Difference]: With dead ends: 1650 [2023-11-25 00:08:07,429 INFO L226 Difference]: Without dead ends: 1394 [2023-11-25 00:08:07,429 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-25 00:08:07,431 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:07,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-11-25 00:08:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2023-11-25 00:08:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 3.1213208901651113) internal successors, (4348), 1393 states have internal predecessors, (4348), 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-25 00:08:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 4348 transitions. [2023-11-25 00:08:07,485 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 4348 transitions. Word has length 21 [2023-11-25 00:08:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:07,485 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 4348 transitions. [2023-11-25 00:08:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 4348 transitions. [2023-11-25 00:08:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:08:07,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:07,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:08:07,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:07,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2031083585, now seen corresponding path program 1 times [2023-11-25 00:08:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800524167] [2023-11-25 00:08:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:07,788 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-25 00:08:07,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800524167] [2023-11-25 00:08:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800524167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:08:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730432385] [2023-11-25 00:08:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:07,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:08:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:08:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:08:07,793 INFO L87 Difference]: Start difference. First operand 1394 states and 4348 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-25 00:08:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:07,942 INFO L93 Difference]: Finished difference Result 1062 states and 3100 transitions. [2023-11-25 00:08:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:08:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-11-25 00:08:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:07,950 INFO L225 Difference]: With dead ends: 1062 [2023-11-25 00:08:07,951 INFO L226 Difference]: Without dead ends: 890 [2023-11-25 00:08:07,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:08:07,953 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:07,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 36 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-11-25 00:08:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2023-11-25 00:08:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 2.920134983127109) internal successors, (2596), 889 states have internal predecessors, (2596), 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-25 00:08:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 2596 transitions. [2023-11-25 00:08:07,990 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 2596 transitions. Word has length 23 [2023-11-25 00:08:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:07,990 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 2596 transitions. [2023-11-25 00:08:07,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-25 00:08:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 2596 transitions. [2023-11-25 00:08:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:08:07,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:07,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:07,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:08:07,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:07,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash -698376582, now seen corresponding path program 1 times [2023-11-25 00:08:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459941419] [2023-11-25 00:08:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:08,371 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-25 00:08:08,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459941419] [2023-11-25 00:08:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459941419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:08,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:08:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671928041] [2023-11-25 00:08:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:08,375 INFO L87 Difference]: Start difference. First operand 890 states and 2596 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:08,541 INFO L93 Difference]: Finished difference Result 666 states and 1912 transitions. [2023-11-25 00:08:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:08:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-25 00:08:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:08,546 INFO L225 Difference]: With dead ends: 666 [2023-11-25 00:08:08,546 INFO L226 Difference]: Without dead ends: 606 [2023-11-25 00:08:08,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:08:08,550 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 115 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:08,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 28 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-25 00:08:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2023-11-25 00:08:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.8826446280991735) internal successors, (1744), 605 states have internal predecessors, (1744), 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-25 00:08:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1744 transitions. [2023-11-25 00:08:08,573 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1744 transitions. Word has length 26 [2023-11-25 00:08:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:08,573 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1744 transitions. [2023-11-25 00:08:08,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1744 transitions. [2023-11-25 00:08:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-25 00:08:08,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:08,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:08,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-25 00:08:08,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:08,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2086406971, now seen corresponding path program 1 times [2023-11-25 00:08:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886689322] [2023-11-25 00:08:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:10,436 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-25 00:08:10,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886689322] [2023-11-25 00:08:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886689322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-25 00:08:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403588338] [2023-11-25 00:08:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:10,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:08:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:08:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:08:10,439 INFO L87 Difference]: Start difference. First operand 606 states and 1744 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:10,825 INFO L93 Difference]: Finished difference Result 742 states and 2100 transitions. [2023-11-25 00:08:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:08:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-25 00:08:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:10,829 INFO L225 Difference]: With dead ends: 742 [2023-11-25 00:08:10,829 INFO L226 Difference]: Without dead ends: 498 [2023-11-25 00:08:10,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-25 00:08:10,831 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:10,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 199 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:08:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-25 00:08:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2023-11-25 00:08:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 2.8329979879275653) internal successors, (1408), 497 states have internal predecessors, (1408), 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-25 00:08:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1408 transitions. [2023-11-25 00:08:10,848 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1408 transitions. Word has length 29 [2023-11-25 00:08:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:10,850 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 1408 transitions. [2023-11-25 00:08:10,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:08:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1408 transitions. [2023-11-25 00:08:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-25 00:08:10,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:10,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-25 00:08:10,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-25 00:08:10,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1759181807, now seen corresponding path program 2 times [2023-11-25 00:08:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982428365] [2023-11-25 00:08:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:08:10,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-25 00:08:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:08:11,043 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-25 00:08:11,043 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-25 00:08:11,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-25 00:08:11,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-25 00:08:11,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-25 00:08:11,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-25 00:08:11,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-25 00:08:11,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-25 00:08:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-25 00:08:11,051 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:11,056 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-25 00:08:11,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:08:11,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-25 00:08:11,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-25 00:08:11,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-25 00:08:11,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:08:11 BasicIcfg [2023-11-25 00:08:11,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:08:11,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:08:11,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:08:11,160 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:08:11,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:02" (3/4) ... [2023-11-25 00:08:11,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-25 00:08:11,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-25 00:08:11,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-25 00:08:11,217 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-25 00:08:11,315 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-25 00:08:11,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:08:11,316 INFO L158 Benchmark]: Toolchain (without parser) took 10631.96ms. Allocated memory was 146.8MB in the beginning and 318.8MB in the end (delta: 172.0MB). Free memory was 100.0MB in the beginning and 211.8MB in the end (delta: -111.8MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,316 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 146.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:08:11,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.50ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 75.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.16ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,318 INFO L158 Benchmark]: Boogie Preprocessor took 40.32ms. Allocated memory is still 146.8MB. Free memory was 72.4MB in the beginning and 70.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,318 INFO L158 Benchmark]: RCFGBuilder took 1206.59ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 70.2MB in the beginning and 118.2MB in the end (delta: -48.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,318 INFO L158 Benchmark]: TraceAbstraction took 8428.24ms. Allocated memory was 197.1MB in the beginning and 318.8MB in the end (delta: 121.6MB). Free memory was 118.2MB in the beginning and 224.4MB in the end (delta: -106.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,319 INFO L158 Benchmark]: Witness Printer took 155.58ms. Allocated memory is still 318.8MB. Free memory was 224.4MB in the beginning and 211.8MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-25 00:08:11,322 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 146.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.50ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 75.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.16ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.32ms. Allocated memory is still 146.8MB. Free memory was 72.4MB in the beginning and 70.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1206.59ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 70.2MB in the beginning and 118.2MB in the end (delta: -48.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8428.24ms. Allocated memory was 197.1MB in the beginning and 318.8MB in the end (delta: 121.6MB). Free memory was 118.2MB in the beginning and 224.4MB in the end (delta: -106.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 155.58ms. Allocated memory is still 318.8MB. Free memory was 224.4MB in the beginning and 211.8MB in the end (delta: 12.6MB). 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 626 mSDsluCounter, 614 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 159 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3796occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-25 00:08:11,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf864cd6-0811-4179-8cc9-f1e46ecc3c54/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE