./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 12:03:56,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 12:03:56,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 12:03:56,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 12:03:56,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 12:03:56,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 12:03:56,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 12:03:56,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 12:03:56,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 12:03:56,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 12:03:56,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 12:03:56,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 12:03:56,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 12:03:56,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 12:03:56,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 12:03:56,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 12:03:56,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 12:03:56,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 12:03:56,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 12:03:56,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 12:03:56,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 12:03:56,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 12:03:56,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 12:03:56,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 12:03:56,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 12:03:56,847 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 12:03:56,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux 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 -> GemCutter 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2024-11-21 12:03:57,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 12:03:57,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 12:03:57,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 12:03:57,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 12:03:57,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 12:03:57,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-21 12:03:58,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1079c8dc3/8d6a30b7554649f99ad301406580d7a0/FLAG9cb19e72a [2024-11-21 12:03:58,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 12:03:58,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-21 12:03:58,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1079c8dc3/8d6a30b7554649f99ad301406580d7a0/FLAG9cb19e72a [2024-11-21 12:03:58,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/1079c8dc3/8d6a30b7554649f99ad301406580d7a0 [2024-11-21 12:03:58,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 12:03:58,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 12:03:58,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 12:03:58,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 12:03:58,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 12:03:58,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:03:58" (1/1) ... [2024-11-21 12:03:58,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b2198c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:58, skipping insertion in model container [2024-11-21 12:03:58,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:03:58" (1/1) ... [2024-11-21 12:03:58,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 12:03:59,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2024-11-21 12:03:59,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 12:03:59,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 12:03:59,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2024-11-21 12:03:59,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 12:03:59,124 INFO L204 MainTranslator]: Completed translation [2024-11-21 12:03:59,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59 WrapperNode [2024-11-21 12:03:59,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 12:03:59,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 12:03:59,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 12:03:59,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 12:03:59,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,162 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2024-11-21 12:03:59,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 12:03:59,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 12:03:59,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 12:03:59,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 12:03:59,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 12:03:59,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 12:03:59,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 12:03:59,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 12:03:59,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (1/1) ... [2024-11-21 12:03:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 12:03:59,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 12:03:59,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 12:03:59,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 12:03:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 12:03:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-21 12:03:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-21 12:03:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-21 12:03:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-21 12:03:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-21 12:03:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-21 12:03:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-21 12:03:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-21 12:03:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 12:03:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-21 12:03:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-21 12:03:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-21 12:03:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-21 12:03:59,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 12:03:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 12:03:59,263 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 12:03:59,373 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 12:03:59,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 12:03:59,730 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 12:03:59,731 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 12:03:59,955 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 12:03:59,955 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-21 12:03:59,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:03:59 BoogieIcfgContainer [2024-11-21 12:03:59,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 12:03:59,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 12:03:59,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 12:03:59,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 12:03:59,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:03:58" (1/3) ... [2024-11-21 12:03:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b15874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:03:59, skipping insertion in model container [2024-11-21 12:03:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:03:59" (2/3) ... [2024-11-21 12:03:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b15874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:03:59, skipping insertion in model container [2024-11-21 12:03:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:03:59" (3/3) ... [2024-11-21 12:03:59,966 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-11-21 12:03:59,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 12:03:59,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 95 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-21 12:03:59,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 12:04:00,071 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-21 12:04:00,126 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 12:04:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 12:04:00,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 12:04:00,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 12:04:00,229 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 12:04:00,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2024-11-21 12:04:00,275 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@2d717e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:00,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 12:04:01,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 12:04:01,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-21 12:04:01,848 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 12:04:01,850 INFO L319 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2024-11-21 12:04:01,855 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:01,860 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 12:04:01,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork1 ======== [2024-11-21 12:04:01,861 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@2d717e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:01,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 12:04:01,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 12:04:01,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-21 12:04:01,968 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 12:04:01,968 INFO L319 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork1 was SAFE,SAFE (2/3) [2024-11-21 12:04:01,971 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:01,972 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 12:04:01,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 12:04:01,973 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@2d717e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 12:04:01,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-21 12:04:02,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:02,008 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:02,008 INFO L139 ounterexampleChecker]: Examining path program with hash -1829300094, occurence #1 [2024-11-21 12:04:02,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:02,009 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1174979261, now seen corresponding path program 1 times [2024-11-21 12:04:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565574457] [2024-11-21 12:04:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 12:04:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565574457] [2024-11-21 12:04:02,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565574457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:02,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:02,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 12:04:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26910480] [2024-11-21 12:04:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:02,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 12:04:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:02,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 12:04:02,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 12:04:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:02,257 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:02,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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) [2024-11-21 12:04:02,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 12:04:06,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:06,424 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:06,427 INFO L139 ounterexampleChecker]: Examining path program with hash -1693734476, occurence #1 [2024-11-21 12:04:06,427 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:06,427 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1346487597, now seen corresponding path program 1 times [2024-11-21 12:04:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930340584] [2024-11-21 12:04:06,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 12:04:07,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930340584] [2024-11-21 12:04:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930340584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480294732] [2024-11-21 12:04:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:07,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:07,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:07,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:07,164 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2024-11-21 12:04:07,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:07,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:07,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 12:04:07,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:07,776 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:07,777 INFO L139 ounterexampleChecker]: Examining path program with hash -1233576619, occurence #1 [2024-11-21 12:04:07,777 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:07,777 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash -422575649, now seen corresponding path program 2 times [2024-11-21 12:04:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123068539] [2024-11-21 12:04:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 12:04:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123068539] [2024-11-21 12:04:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123068539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:08,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:08,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889916817] [2024-11-21 12:04:08,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:08,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:08,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:08,170 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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) [2024-11-21 12:04:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:08,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:09,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 12:04:09,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:09,779 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:09,779 INFO L139 ounterexampleChecker]: Examining path program with hash 1717633832, occurence #1 [2024-11-21 12:04:09,779 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:09,779 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1275023644, now seen corresponding path program 3 times [2024-11-21 12:04:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888987233] [2024-11-21 12:04:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 12:04:09,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:09,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888987233] [2024-11-21 12:04:09,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888987233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984859663] [2024-11-21 12:04:09,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:09,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:09,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:09,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:09,905 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:09,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2024-11-21 12:04:09,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:09,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:09,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:09,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 12:04:11,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:11,102 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:11,103 INFO L139 ounterexampleChecker]: Examining path program with hash 483740084, occurence #1 [2024-11-21 12:04:11,103 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:11,103 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -658444335, now seen corresponding path program 4 times [2024-11-21 12:04:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247069000] [2024-11-21 12:04:11,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 12:04:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247069000] [2024-11-21 12:04:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247069000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860869526] [2024-11-21 12:04:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:11,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:11,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:11,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:11,292 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2024-11-21 12:04:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 12:04:12,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:12,166 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:12,166 INFO L139 ounterexampleChecker]: Examining path program with hash 1361001210, occurence #1 [2024-11-21 12:04:12,166 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:12,166 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1971296303, now seen corresponding path program 5 times [2024-11-21 12:04:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038761943] [2024-11-21 12:04:12,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 12:04:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038761943] [2024-11-21 12:04:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038761943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008272989] [2024-11-21 12:04:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:12,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:12,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:12,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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) [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:12,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 12:04:13,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:13,122 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:13,123 INFO L139 ounterexampleChecker]: Examining path program with hash 666983441, occurence #1 [2024-11-21 12:04:13,123 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:13,123 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 939510604, now seen corresponding path program 6 times [2024-11-21 12:04:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:13,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068966327] [2024-11-21 12:04:13,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 12:04:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 12:04:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 12:04:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068966327] [2024-11-21 12:04:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068966327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 12:04:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 12:04:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 12:04:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033478953] [2024-11-21 12:04:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 12:04:13,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 12:04:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 12:04:13,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 12:04:13,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 12:04:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 12:04:13,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 12:04:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 12:04:13,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 12:04:13,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 12:04:13,943 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 12:04:13,944 INFO L139 ounterexampleChecker]: Examining path program with hash -1330724840, occurence #1 [2024-11-21 12:04:13,944 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 12:04:13,944 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 12:04:13,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 12:04:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1139542813, now seen corresponding path program 1 times [2024-11-21 12:04:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 12:04:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139441402] [2024-11-21 12:04:13,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 12:04:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 12:04:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 12:04:14,044 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 12:04:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 12:04:14,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 12:04:14,140 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 12:04:14,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-21 12:04:14,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-21 12:04:14,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-21 12:04:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 12:04:14,143 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-11-21 12:04:14,143 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2024-11-21 12:04:14,249 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-21 12:04:14,250 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 12:04:14,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-21 12:04:14,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:04:14 BasicIcfg [2024-11-21 12:04:14,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 12:04:14,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 12:04:14,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 12:04:14,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 12:04:14,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:03:59" (3/4) ... [2024-11-21 12:04:14,291 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 12:04:14,398 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 25. [2024-11-21 12:04:14,456 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-11-21 12:04:14,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2024-11-21 12:04:14,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 12:04:14,458 INFO L158 Benchmark]: Toolchain (without parser) took 15608.76ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 59.9MB in the beginning and 619.7MB in the end (delta: -559.7MB). Peak memory consumption was 412.9MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,458 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 12:04:14,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.76ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,459 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 12:04:14,460 INFO L158 Benchmark]: RCFGBuilder took 755.71ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 39.6MB in the end (delta: 4.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,460 INFO L158 Benchmark]: TraceAbstraction took 14330.26ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 39.1MB in the beginning and 654.3MB in the end (delta: -615.3MB). Peak memory consumption was 359.0MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,461 INFO L158 Benchmark]: Witness Printer took 167.55ms. Allocated memory is still 1.1GB. Free memory was 654.3MB in the beginning and 619.7MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-21 12:04:14,462 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.44ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.76ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 47.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 755.71ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 39.6MB in the end (delta: 4.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14330.26ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 39.1MB in the beginning and 654.3MB in the end (delta: -615.3MB). Peak memory consumption was 359.0MB. Max. memory is 16.1GB. * Witness Printer took 167.55ms. Allocated memory is still 1.1GB. Free memory was 654.3MB in the beginning and 619.7MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10811, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4819, independent: 4765, independent conditional: 0, independent unconditional: 4765, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4819, independent: 4756, independent conditional: 0, independent unconditional: 4756, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1030, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 861, dependent conditional: 0, dependent unconditional: 861, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10283, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4819, unknown conditional: 0, unknown unconditional: 4819] , Statistics on independence cache: Total cache size (in pairs): 4819, Positive cache size: 4765, Positive conditional cache size: 0, Positive unconditional cache size: 4765, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5256, Maximal queried relation: 0, Independence queries for same thread: 528, Persistent sets #1 benchmarks: Persistent set computation time: 1.3s, Number of persistent set computation: 437, Number of trivial persistent sets: 36, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5027, independent: 4973, independent conditional: 0, independent unconditional: 4973, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10811, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 5241, independent unconditional: 4973, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10283, independent: 10214, independent conditional: 0, independent unconditional: 10214, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4819, independent: 4765, independent conditional: 0, independent unconditional: 4765, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4819, independent: 4756, independent conditional: 0, independent unconditional: 4756, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1030, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 861, dependent conditional: 0, dependent unconditional: 861, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10283, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4819, unknown conditional: 0, unknown unconditional: 4819] , Statistics on independence cache: Total cache size (in pairs): 4819, Positive cache size: 4765, Positive conditional cache size: 0, Positive unconditional cache size: 4765, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5256, Maximal queried relation: 0, Independence queries for same thread: 528 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6758, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6556, independent: 6204, independent conditional: 0, independent unconditional: 6204, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5102, Positive cache size: 5048, Positive conditional cache size: 0, Positive unconditional cache size: 5048, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1780, Maximal queried relation: 0, Independence queries for same thread: 202, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 156, Number of trivial persistent sets: 22, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4776, independent: 4722, independent conditional: 0, independent unconditional: 4722, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6758, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 1765, independent unconditional: 4722, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6556, independent: 6487, independent conditional: 0, independent unconditional: 6487, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6556, independent: 6204, independent conditional: 0, independent unconditional: 6204, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5102, Positive cache size: 5048, Positive conditional cache size: 0, Positive unconditional cache size: 5048, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1780, Maximal queried relation: 0, Independence queries for same thread: 202 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 634649, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 60659, dependent conditional: 60581, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 586825, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 12835, dependent conditional: 12757, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 586825, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 12835, dependent conditional: 12757, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 35325, dependent conditional: 35247, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 180, independent unconditional: 573810, dependent: 35325, dependent conditional: 2369, dependent unconditional: 32956, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 180, independent unconditional: 573810, dependent: 35325, dependent conditional: 2369, dependent unconditional: 32956, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2294, independent: 2255, independent conditional: 2, independent unconditional: 2253, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2294, independent: 2241, independent conditional: 0, independent unconditional: 2241, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, independent: 83, independent conditional: 17, independent unconditional: 66, dependent: 261, dependent conditional: 45, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 609315, independent: 571735, independent conditional: 178, independent unconditional: 571557, dependent: 35286, dependent conditional: 2360, dependent unconditional: 32926, unknown: 2294, unknown conditional: 11, unknown unconditional: 2283] , Statistics on independence cache: Total cache size (in pairs): 7396, Positive cache size: 7303, Positive conditional cache size: 2, Positive unconditional cache size: 7301, Negative cache size: 93, Negative conditional cache size: 9, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 598404, Maximal queried relation: 4, Independence queries for same thread: 47824, Persistent sets #1 benchmarks: Persistent set computation time: 2.0s, Number of persistent set computation: 33098, Number of trivial persistent sets: 33086, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8362, independent: 8284, independent conditional: 0, independent unconditional: 8284, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 634649, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 60659, dependent conditional: 60581, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 586825, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 12835, dependent conditional: 12757, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 586825, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 12835, dependent conditional: 12757, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 565706, independent unconditional: 8284, dependent: 35325, dependent conditional: 35247, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 180, independent unconditional: 573810, dependent: 35325, dependent conditional: 2369, dependent unconditional: 32956, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 609315, independent: 573990, independent conditional: 180, independent unconditional: 573810, dependent: 35325, dependent conditional: 2369, dependent unconditional: 32956, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2294, independent: 2255, independent conditional: 2, independent unconditional: 2253, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2294, independent: 2241, independent conditional: 0, independent unconditional: 2241, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, independent: 83, independent conditional: 17, independent unconditional: 66, dependent: 261, dependent conditional: 45, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 609315, independent: 571735, independent conditional: 178, independent unconditional: 571557, dependent: 35286, dependent conditional: 2360, dependent unconditional: 32926, unknown: 2294, unknown conditional: 11, unknown unconditional: 2283] , Statistics on independence cache: Total cache size (in pairs): 7396, Positive cache size: 7303, Positive conditional cache size: 2, Positive unconditional cache size: 7301, Negative cache size: 93, Negative conditional cache size: 9, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 598404, Maximal queried relation: 4, Independence queries for same thread: 47824 - CounterExampleResult [Line: 171]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] 0 _Atomic unsigned int x_0, y_1, x_8, y_9; [L37] 0 _Atomic _Bool f1_2, f2_3, f1_10, f2_11; [L38] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L142] 0 pthread_t t1, t4; [L145] 0 x_0 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=0, y_1=0, y_9=0] [L146] 0 y_1 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=0, y_1=3, y_9=0] [L147] 0 x_8 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=4294967295, y_1=3, y_9=0] [L148] 0 y_9 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L149] 0 temp_4 = __VERIFIER_nondet_uint() [L150] 0 temp_5 = __VERIFIER_nondet_uint() [L151] 0 temp_6 = __VERIFIER_nondet_uint() [L152] 0 temp_7 = __VERIFIER_nondet_uint() [L153] 0 temp_12 = __VERIFIER_nondet_uint() [L154] 0 temp_13 = __VERIFIER_nondet_uint() [L155] 0 temp_14 = __VERIFIER_nondet_uint() [L156] 0 temp_15 = __VERIFIER_nondet_uint() [L157] 0 f1_2 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L163] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L33] COND FALSE 0 !(!cond) [L163] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L165] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(_argptr)={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-5, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L78] 1 pthread_t t2, t3; VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L80] 1 f1_2 = 0 VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L81] 1 f2_3 = 0 VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L166] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L128] 4 pthread_t t5, t6; VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L130] 4 f1_10 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L131] 4 f2_11 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L133] FCALL, FORK 4 pthread_create(&t5, 0, thread5, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L134] FCALL, FORK 4 pthread_create(&t6, 0, thread6, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L42] COND TRUE 2 __VERIFIER_nondet_bool() [L43] 2 temp_4 = x_0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L44] 2 x_0 = temp_4 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L46] 2 f1_2 = 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L60] COND TRUE 3 __VERIFIER_nondet_bool() [L61] 3 temp_6 = y_1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=3, y_9=-4294967293] [L62] 3 y_1 = temp_6 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L64] 3 f2_3 = 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L47] CALL 2 assume_abort_if_not(f2_3) [L33] COND FALSE 2 !(!cond) [L47] RET 2 assume_abort_if_not(f2_3) [L49] 2 temp_5 = y_1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, x_0=0, x_8=4294967295, y_1=4, y_9=-4294967293] [L50] 2 y_1 = temp_5 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L65] CALL 3 assume_abort_if_not(f1_2) [L33] COND FALSE 3 !(!cond) [L65] RET 3 assume_abort_if_not(f1_2) [L67] 3 temp_7 = x_0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L52] 2 f1_2 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=0, x_8=4294967295, y_1=5, y_9=-4294967293] [L68] 3 x_0 = temp_7 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=1, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L70] 3 f2_3 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L53] CALL 2 assume_abort_if_not(!f2_3) [L33] COND FALSE 2 !(!cond) [L53] RET 2 assume_abort_if_not(!f2_3) [L71] CALL 3 assume_abort_if_not(!f1_2) [L33] COND FALSE 3 !(!cond) [L71] RET 3 assume_abort_if_not(!f1_2) [L92] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L106] 5 return 0; [L135] FCALL, JOIN 5 pthread_join(t5, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L110] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L124] 6 return 0; [L136] FCALL, JOIN 6 pthread_join(t6, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L138] 4 return 0; [L42] COND FALSE 2 !(__VERIFIER_nondet_bool()) [L56] 2 return 0; [L85] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L60] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L74] 3 return 0; [L86] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L88] 1 return 0; [L167] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L168] FCALL, JOIN 4 pthread_join(t4, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] [L170] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L33] COND FALSE 0 !(!cond) [L170] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L171] 0 reach_error() VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_4=-1, temp_5=4, temp_6=3, temp_7=0, x_0=1, x_8=4294967295, y_1=5, y_9=-4294967293] - UnprovableResult [Line: 166]: 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: 165]: 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 for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 1.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1Thread1of1ForFork1 with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 9.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 1751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15/15 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-21 12:04:14,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/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