./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 01:01:22,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 01:01:22,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 01:01:22,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 01:01:22,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 01:01:22,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 01:01:22,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 01:01:22,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 01:01:22,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 01:01:22,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 01:01:22,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 01:01:22,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 01:01:22,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 01:01:22,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 01:01:22,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 01:01:22,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 01:01:22,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 01:01:22,328 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 01:01:22,328 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-04-25 01:01:22,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 01:01:22,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 01:01:22,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 01:01:22,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 01:01:22,577 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 01:01:22,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-04-25 01:01:23,951 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7432dfbdf/d13b06686f7543579c036bff08d00e3d/FLAG285ccbb89 [2025-04-25 01:01:24,209 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 01:01:24,210 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-04-25 01:01:24,218 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7432dfbdf/d13b06686f7543579c036bff08d00e3d/FLAG285ccbb89 [2025-04-25 01:01:25,001 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7432dfbdf/d13b06686f7543579c036bff08d00e3d [2025-04-25 01:01:25,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 01:01:25,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 01:01:25,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 01:01:25,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 01:01:25,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 01:01:25,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6106aa46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25, skipping insertion in model container [2025-04-25 01:01:25,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 01:01:25,210 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-25 01:01:25,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 01:01:25,227 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 01:01:25,262 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-25 01:01:25,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 01:01:25,275 INFO L204 MainTranslator]: Completed translation [2025-04-25 01:01:25,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25 WrapperNode [2025-04-25 01:01:25,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 01:01:25,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 01:01:25,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 01:01:25,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 01:01:25,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,316 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2025-04-25 01:01:25,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 01:01:25,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 01:01:25,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 01:01:25,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 01:01:25,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 01:01:25,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 01:01:25,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 01:01:25,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 01:01:25,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (1/1) ... [2025-04-25 01:01:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 01:01:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 01:01:25,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 01:01:25,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 01:01:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 01:01:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 01:01:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 01:01:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 01:01:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 01:01:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 01:01:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 01:01:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-25 01:01:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-25 01:01:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 01:01:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-25 01:01:25,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-25 01:01:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-25 01:01:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-25 01:01:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 01:01:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 01:01:25,402 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 01:01:25,481 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 01:01:25,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 01:01:25,720 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 01:01:25,720 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 01:01:25,892 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 01:01:25,893 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-25 01:01:25,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 01:01:25 BoogieIcfgContainer [2025-04-25 01:01:25,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 01:01:25,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 01:01:25,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 01:01:25,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 01:01:25,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 01:01:25" (1/3) ... [2025-04-25 01:01:25,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd7de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 01:01:25, skipping insertion in model container [2025-04-25 01:01:25,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 01:01:25" (2/3) ... [2025-04-25 01:01:25,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd7de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 01:01:25, skipping insertion in model container [2025-04-25 01:01:25,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 01:01:25" (3/3) ... [2025-04-25 01:01:25,903 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-04-25 01:01:25,913 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 01:01:25,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 95 locations, 96 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-25 01:01:25,915 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 01:01:26,033 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-25 01:01:26,072 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 01:01:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 01:01:26,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 01:01:26,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 01:01:26,160 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 01:01:26,165 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2025-04-25 01:01:26,173 INFO L340 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;@79ea2b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:26,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 01:01:28,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 01:01:28,457 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 01:01:28,462 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-25 01:01:28,464 INFO L320 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2025-04-25 01:01:28,469 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:28,472 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 01:01:28,474 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork1 ======== [2025-04-25 01:01:28,474 INFO L340 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;@79ea2b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:28,474 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 01:01:30,079 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 01:01:30,079 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 01:01:30,080 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-25 01:01:30,080 INFO L320 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork1 was SAFE,SAFE (2/3) [2025-04-25 01:01:30,082 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:30,083 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 01:01:30,083 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 01:01:30,083 INFO L340 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;@79ea2b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 01:01:30,083 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 01:01:30,094 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:30,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1174979261, now seen corresponding path program 1 times [2025-04-25 01:01:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:30,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075576922] [2025-04-25 01:01:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 01:01:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:30,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-25 01:01:30,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-25 01:01:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 01:01:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:01:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:30,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075576922] [2025-04-25 01:01:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075576922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:30,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:30,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 01:01:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349900914] [2025-04-25 01:01:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:30,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 01:01:30,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:30,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 01:01:30,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 01:01:30,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:30,286 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:30,288 INFO L486 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) [2025-04-25 01:01:30,288 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:31,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:31,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 01:01:31,402 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:31,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1346487597, now seen corresponding path program 1 times [2025-04-25 01:01:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:31,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903106444] [2025-04-25 01:01:31,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 01:01:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:31,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-04-25 01:01:31,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-04-25 01:01:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 01:01:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:01:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:31,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903106444] [2025-04-25 01:01:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903106444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922176244] [2025-04-25 01:01:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:31,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:31,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:31,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:31,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:31,908 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:31,909 INFO L486 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) [2025-04-25 01:01:31,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:31,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:32,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:32,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:32,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 01:01:32,312 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:32,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -422575649, now seen corresponding path program 2 times [2025-04-25 01:01:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:32,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001823204] [2025-04-25 01:01:32,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 01:01:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:32,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 383 statements into 2 equivalence classes. [2025-04-25 01:01:32,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 231 of 383 statements. [2025-04-25 01:01:32,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 01:01:32,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-25 01:01:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:32,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001823204] [2025-04-25 01:01:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001823204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:32,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354455104] [2025-04-25 01:01:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:32,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:32,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:32,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:32,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:32,497 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:32,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2025-04-25 01:01:32,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:32,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:32,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:34,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:34,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:34,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:34,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 01:01:34,409 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:34,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2041688963, now seen corresponding path program 3 times [2025-04-25 01:01:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:34,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323799487] [2025-04-25 01:01:34,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 01:01:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:34,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 591 statements into 3 equivalence classes. [2025-04-25 01:01:34,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 295 of 591 statements. [2025-04-25 01:01:34,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-25 01:01:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-25 01:01:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:34,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323799487] [2025-04-25 01:01:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323799487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:34,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:34,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474795638] [2025-04-25 01:01:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:34,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:34,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:34,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:34,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:34,633 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:34,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 01:01:34,633 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:34,634 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:34,634 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:34,634 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 01:01:35,268 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:35,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -658444335, now seen corresponding path program 4 times [2025-04-25 01:01:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:35,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788348877] [2025-04-25 01:01:35,269 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 01:01:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:35,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-25 01:01:35,329 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-25 01:01:35,329 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 01:01:35,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 01:01:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:35,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788348877] [2025-04-25 01:01:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788348877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751133796] [2025-04-25 01:01:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:35,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:35,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:35,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:35,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,426 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:35,426 INFO L486 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) [2025-04-25 01:01:35,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 01:01:35,848 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:35,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1683253364, now seen corresponding path program 5 times [2025-04-25 01:01:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:35,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015522978] [2025-04-25 01:01:35,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 01:01:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:35,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 1 equivalence classes. [2025-04-25 01:01:35,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-25 01:01:35,876 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 01:01:35,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:01:35,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:35,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015522978] [2025-04-25 01:01:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015522978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:35,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355784298] [2025-04-25 01:01:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:35,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:35,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:35,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,935 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:35,936 INFO L486 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) [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:35,936 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 01:01:36,269 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:36,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1465280675, now seen corresponding path program 1 times [2025-04-25 01:01:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:36,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046742420] [2025-04-25 01:01:36,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 01:01:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:36,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-25 01:01:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-25 01:01:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 01:01:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:01:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:01:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:01:36,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046742420] [2025-04-25 01:01:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046742420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 01:01:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 01:01:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 01:01:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355256569] [2025-04-25 01:01:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 01:01:36,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 01:01:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:01:36,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 01:01:36,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 01:01:36,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,363 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:01:36,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:01:36,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 01:01:36,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 01:01:36,611 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:01:36,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:01:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1139542813, now seen corresponding path program 2 times [2025-04-25 01:01:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:01:36,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701113241] [2025-04-25 01:01:36,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 01:01:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:01:36,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 1 equivalence classes. [2025-04-25 01:01:36,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-25 01:01:36,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 01:01:36,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 01:01:36,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 01:01:36,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-25 01:01:36,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-25 01:01:36,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 01:01:36,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 01:01:36,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 01:01:36,705 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 01:01:36,705 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-25 01:01:36,705 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 01:01:36,706 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 01:01:36,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 01:01:36,706 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2025-04-25 01:01:36,707 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2025-04-25 01:01:36,823 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 01:01:36,823 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 01:01:36,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 01:01:36,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 01:01:36 BasicIcfg [2025-04-25 01:01:36,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 01:01:36,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 01:01:36,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 01:01:36,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 01:01:36,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 01:01:25" (3/4) ... [2025-04-25 01:01:36,837 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-25 01:01:36,945 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 25. [2025-04-25 01:01:37,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 01:01:37,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 01:01:37,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 01:01:37,001 INFO L158 Benchmark]: Toolchain (without parser) took 11996.28ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.9MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2025-04-25 01:01:37,001 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 01:01:37,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.15ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-25 01:01:37,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 01:01:37,002 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 01:01:37,002 INFO L158 Benchmark]: RCFGBuilder took 549.78ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 44.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-25 01:01:37,002 INFO L158 Benchmark]: TraceAbstraction took 10940.57ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 43.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 805.1MB. Max. memory is 16.1GB. [2025-04-25 01:01:37,003 INFO L158 Benchmark]: Witness Printer took 165.24ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-25 01:01:37,004 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.16ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.15ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 91.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.63ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 549.78ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 44.0MB in the end (delta: 43.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10940.57ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 43.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 805.1MB. Max. memory is 16.1GB. * Witness Printer took 165.24ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 34.6MB). 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: 294833, independent: 275443, independent conditional: 275443, independent unconditional: 0, dependent: 19390, dependent conditional: 19390, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 278299, independent: 275443, independent conditional: 0, independent unconditional: 275443, dependent: 2856, dependent conditional: 0, dependent unconditional: 2856, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1608, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1608, independent: 1572, independent conditional: 0, independent unconditional: 1572, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 278299, independent: 273863, independent conditional: 0, independent unconditional: 273863, dependent: 2828, dependent conditional: 0, dependent unconditional: 2828, unknown: 1608, unknown conditional: 0, unknown unconditional: 1608] , Statistics on independence cache: Total cache size (in pairs): 1608, Positive cache size: 1580, Positive conditional cache size: 0, Positive unconditional cache size: 1580, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 16534 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 285949, independent: 267421, independent conditional: 267421, independent unconditional: 0, dependent: 18528, dependent conditional: 18528, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 270180, independent: 267421, independent conditional: 0, independent unconditional: 267421, dependent: 2759, dependent conditional: 0, dependent unconditional: 2759, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 933, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 933, independent: 905, independent conditional: 0, independent unconditional: 905, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 270180, independent: 266508, independent conditional: 0, independent unconditional: 266508, dependent: 2739, dependent conditional: 0, dependent unconditional: 2739, unknown: 933, unknown conditional: 0, unknown unconditional: 933] , Statistics on independence cache: Total cache size (in pairs): 2541, Positive cache size: 2493, Positive conditional cache size: 0, Positive unconditional cache size: 2493, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 15769 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 805494, independent: 727657, independent conditional: 727657, independent unconditional: 0, dependent: 77837, dependent conditional: 77837, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 744417, independent: 727657, independent conditional: 0, independent unconditional: 727657, dependent: 16760, dependent conditional: 0, dependent unconditional: 16760, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 496, independent: 496, independent conditional: 0, independent unconditional: 496, 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: 496, independent: 496, independent conditional: 0, independent unconditional: 496, 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: 744417, independent: 727161, independent conditional: 0, independent unconditional: 727161, dependent: 16760, dependent conditional: 0, dependent unconditional: 16760, unknown: 496, unknown conditional: 0, unknown unconditional: 496] , Statistics on independence cache: Total cache size (in pairs): 3037, Positive cache size: 2989, Positive conditional cache size: 0, Positive unconditional cache size: 2989, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 61077 - 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=1, 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 [\at(_argptr, Pre)={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t1=-5, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L78] 1 pthread_t t2, t3; VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L80] 1 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, x_0=-1, x_8=4294967295, y_1=3, y_9=-4294967293] [L81] 1 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, 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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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 [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={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, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 2.3s, 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1Thread1of1ForFork1 with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 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: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 5.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: 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.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1980 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-25 01:01:37,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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