./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0aec71060adac9a809b489622cf59358c372cc7dfb6e4fbe30eff146e68fc25 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:29,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:29,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:58:29,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:29,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:29,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:29,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:29,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:29,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:29,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:29,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:29,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:29,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:29,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:29,293 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:29,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:29,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:29,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:29,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:29,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:29,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:29,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 -> Automizer 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 -> a0aec71060adac9a809b489622cf59358c372cc7dfb6e4fbe30eff146e68fc25 [2025-04-29 10:58:29,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:29,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:29,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:29,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:29,525 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:29,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c [2025-04-29 10:58:30,800 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114e141e8/2e02bd1d62984fb3841051be93e324f9/FLAG885395771 [2025-04-29 10:58:31,010 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:31,010 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c [2025-04-29 10:58:31,011 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:31,012 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:31,012 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:31,012 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:31,018 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114e141e8/2e02bd1d62984fb3841051be93e324f9/FLAG885395771 [2025-04-29 10:58:32,001 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114e141e8/2e02bd1d62984fb3841051be93e324f9 [2025-04-29 10:58:32,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:32,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:32,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:32,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:32,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:32,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d287b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32, skipping insertion in model container [2025-04-29 10:58:32,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:32,151 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c[834,847] [2025-04-29 10:58:32,174 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:32,181 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:32,198 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.c[834,847] [2025-04-29 10:58:32,202 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:32,210 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:32,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32 WrapperNode [2025-04-29 10:58:32,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:32,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:32,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:32,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:32,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,230 INFO L138 Inliner]: procedures = 10, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-04-29 10:58:32,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:32,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:32,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:32,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:32,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,245 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:58:32,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:32,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:32,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:32,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:32,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (1/1) ... [2025-04-29 10:58:32,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:32,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:32,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:58:32,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:58:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-29 10:58:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-29 10:58:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:32,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-29 10:58:32,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-29 10:58:32,302 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 10:58:32,348 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:32,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:32,442 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:58:32,443 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:32,508 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:32,510 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:58:32,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:32 BoogieIcfgContainer [2025-04-29 10:58:32,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:32,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:32,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:32,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:32,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:32" (1/3) ... [2025-04-29 10:58:32,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266389a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:32, skipping insertion in model container [2025-04-29 10:58:32,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:32" (2/3) ... [2025-04-29 10:58:32,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266389a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:32, skipping insertion in model container [2025-04-29 10:58:32,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:32" (3/3) ... [2025-04-29 10:58:32,518 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.c [2025-04-29 10:58:32,528 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:32,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.c that has 2 procedures, 20 locations, 21 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:58:32,531 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:58:32,563 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 10:58:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2025-04-29 10:58:32,608 INFO L116 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-04-29 10:58:32,609 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:32,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-29 10:58:32,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2025-04-29 10:58:32,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2025-04-29 10:58:32,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:32,630 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=PETRI_NET, 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;@3daf9f3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:32,630 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-29 10:58:32,636 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:58:32,637 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-29 10:58:32,637 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:32,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:32,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:32,637 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:32,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1264782899, now seen corresponding path program 1 times [2025-04-29 10:58:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:32,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890557903] [2025-04-29 10:58:32,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:32,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:58:32,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:58:32,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:32,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,762 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-29 10:58:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:32,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890557903] [2025-04-29 10:58:32,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890557903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760591351] [2025-04-29 10:58:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:32,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:32,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:32,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:32,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 22 [2025-04-29 10:58:32,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-29 10:58:32,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:32,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 22 [2025-04-29 10:58:32,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:32,841 INFO L116 PetriNetUnfolderBase]: 13/48 cut-off events. [2025-04-29 10:58:32,841 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 48 events. 13/48 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 3 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 66. Up to 21 conditions per place. [2025-04-29 10:58:32,843 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 12 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-04-29 10:58:32,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 78 flow [2025-04-29 10:58:32,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:58:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-29 10:58:32,853 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-04-29 10:58:32,854 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 45 transitions. [2025-04-29 10:58:32,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 78 flow [2025-04-29 10:58:32,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 10:58:32,860 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2025-04-29 10:58:32,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-29 10:58:32,864 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-29 10:58:32,865 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2025-04-29 10:58:32,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-29 10:58:32,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:32,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:32,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:32,865 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:32,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 269388770, now seen corresponding path program 1 times [2025-04-29 10:58:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:32,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326103066] [2025-04-29 10:58:32,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:32,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:58:32,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:58:32,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:32,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326103066] [2025-04-29 10:58:32,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326103066] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:32,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006375424] [2025-04-29 10:58:32,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:32,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:32,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:58:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:58:32,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:58:32,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:32,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 10:58:32,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:33,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:58:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006375424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:58:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-04-29 10:58:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747368236] [2025-04-29 10:58:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:33,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:33,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:33,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:33,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-29 10:58:33,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-29 10:58:33,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:33,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-29 10:58:33,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:33,066 INFO L116 PetriNetUnfolderBase]: 25/80 cut-off events. [2025-04-29 10:58:33,066 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-29 10:58:33,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 80 events. 25/80 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 10 based on Foata normal form. 6/81 useless extension candidates. Maximal degree in co-relation 39. Up to 41 conditions per place. [2025-04-29 10:58:33,067 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 16 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-04-29 10:58:33,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 108 flow [2025-04-29 10:58:33,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:58:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-29 10:58:33,069 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-29 10:58:33,069 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 44 transitions. [2025-04-29 10:58:33,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 108 flow [2025-04-29 10:58:33,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:33,070 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2025-04-29 10:58:33,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-29 10:58:33,071 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-04-29 10:58:33,073 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2025-04-29 10:58:33,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-29 10:58:33,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:33,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:33,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:58:33,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:33,275 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:33,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash 814699087, now seen corresponding path program 1 times [2025-04-29 10:58:33,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:33,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719866287] [2025-04-29 10:58:33,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:58:33,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:58:33,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:33,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719866287] [2025-04-29 10:58:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719866287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:33,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76948189] [2025-04-29 10:58:33,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:33,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:33,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:58:33,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:58:33,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:58:33,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:33,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:33,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:58:33,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:33,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76948189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:33,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-29 10:58:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144142313] [2025-04-29 10:58:33,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:33,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:58:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:33,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:58:33,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:33,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-29 10:58:33,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-29 10:58:33,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:33,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-29 10:58:33,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:33,580 INFO L116 PetriNetUnfolderBase]: 67/174 cut-off events. [2025-04-29 10:58:33,580 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-29 10:58:33,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 174 events. 67/174 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 614 event pairs, 10 based on Foata normal form. 18/188 useless extension candidates. Maximal degree in co-relation 110. Up to 35 conditions per place. [2025-04-29 10:58:33,582 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-04-29 10:58:33,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 228 flow [2025-04-29 10:58:33,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:58:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-29 10:58:33,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-04-29 10:58:33,585 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 6 states and 86 transitions. [2025-04-29 10:58:33,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 228 flow [2025-04-29 10:58:33,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:33,588 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 98 flow [2025-04-29 10:58:33,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-29 10:58:33,589 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-29 10:58:33,589 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 98 flow [2025-04-29 10:58:33,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-29 10:58:33,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:33,590 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:33,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:33,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-29 10:58:33,791 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:33,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash -687099256, now seen corresponding path program 2 times [2025-04-29 10:58:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:33,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447414472] [2025-04-29 10:58:33,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:33,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 10:58:33,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:58:33,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:33,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 10:58:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:33,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447414472] [2025-04-29 10:58:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447414472] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:33,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61123962] [2025-04-29 10:58:33,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:33,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:58:33,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 10:58:33,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:58:33,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:33,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:33,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:58:33,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:33,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:58:34,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61123962] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:34,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:34,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-04-29 10:58:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161896917] [2025-04-29 10:58:34,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:34,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:58:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:34,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:58:34,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:58:34,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-29 10:58:34,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 98 flow. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 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-29 10:58:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-29 10:58:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:34,458 INFO L116 PetriNetUnfolderBase]: 185/522 cut-off events. [2025-04-29 10:58:34,458 INFO L117 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-04-29 10:58:34,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 522 events. 185/522 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2240 event pairs, 6 based on Foata normal form. 71/591 useless extension candidates. Maximal degree in co-relation 395. Up to 96 conditions per place. [2025-04-29 10:58:34,464 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 92 selfloop transitions, 69 changer transitions 0/167 dead transitions. [2025-04-29 10:58:34,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 167 transitions, 1092 flow [2025-04-29 10:58:34,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-29 10:58:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-29 10:58:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 462 transitions. [2025-04-29 10:58:34,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2025-04-29 10:58:34,468 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 98 flow. Second operand 34 states and 462 transitions. [2025-04-29 10:58:34,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 167 transitions, 1092 flow [2025-04-29 10:58:34,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 167 transitions, 1032 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:34,475 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 730 flow [2025-04-29 10:58:34,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=730, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-04-29 10:58:34,475 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2025-04-29 10:58:34,477 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 730 flow [2025-04-29 10:58:34,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 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-29 10:58:34,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:34,477 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:34,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:34,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:34,678 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:34,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1756838839, now seen corresponding path program 3 times [2025-04-29 10:58:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:34,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397045728] [2025-04-29 10:58:34,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:58:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:34,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-04-29 10:58:34,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 50 statements. [2025-04-29 10:58:34,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 10:58:34,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 10:58:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:34,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397045728] [2025-04-29 10:58:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397045728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:34,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468626047] [2025-04-29 10:58:34,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:58:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:34,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:34,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:34,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:58:34,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-04-29 10:58:34,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 50 statements. [2025-04-29 10:58:34,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 10:58:34,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:34,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:58:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 10:58:34,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 10:58:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468626047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:34,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-29 10:58:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827221320] [2025-04-29 10:58:34,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:34,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:58:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:58:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:58:34,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-29 10:58:34,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 730 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:34,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:34,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-29 10:58:34,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:34,979 INFO L116 PetriNetUnfolderBase]: 287/798 cut-off events. [2025-04-29 10:58:34,979 INFO L117 PetriNetUnfolderBase]: For 13164/13264 co-relation queries the response was YES. [2025-04-29 10:58:34,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 798 events. 287/798 cut-off events. For 13164/13264 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4247 event pairs, 59 based on Foata normal form. 79/816 useless extension candidates. Maximal degree in co-relation 3335. Up to 248 conditions per place. [2025-04-29 10:58:34,986 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 94 selfloop transitions, 38 changer transitions 0/143 dead transitions. [2025-04-29 10:58:34,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 143 transitions, 1502 flow [2025-04-29 10:58:34,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:58:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:58:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2025-04-29 10:58:34,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6534090909090909 [2025-04-29 10:58:34,987 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 730 flow. Second operand 8 states and 115 transitions. [2025-04-29 10:58:34,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 143 transitions, 1502 flow [2025-04-29 10:58:35,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 1416 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-29 10:58:35,009 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 866 flow [2025-04-29 10:58:35,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-04-29 10:58:35,010 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2025-04-29 10:58:35,010 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 866 flow [2025-04-29 10:58:35,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:35,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:35,010 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:35,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:35,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:35,211 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:35,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2088585799, now seen corresponding path program 4 times [2025-04-29 10:58:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:35,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760737020] [2025-04-29 10:58:35,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:58:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:35,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-29 10:58:35,243 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-29 10:58:35,243 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:58:35,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-29 10:58:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:35,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760737020] [2025-04-29 10:58:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760737020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:35,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421015372] [2025-04-29 10:58:35,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:58:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:35,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:35,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:58:35,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-29 10:58:35,484 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-29 10:58:35,485 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:58:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:35,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:58:35,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-29 10:58:35,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-29 10:58:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421015372] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:35,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-04-29 10:58:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010807677] [2025-04-29 10:58:35,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:35,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:58:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:35,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:58:35,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:58:35,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-29 10:58:35,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 866 flow. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 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-29 10:58:35,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:35,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-29 10:58:35,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:36,144 INFO L116 PetriNetUnfolderBase]: 607/1664 cut-off events. [2025-04-29 10:58:36,145 INFO L117 PetriNetUnfolderBase]: For 58896/58898 co-relation queries the response was YES. [2025-04-29 10:58:36,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 1664 events. 607/1664 cut-off events. For 58896/58898 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9592 event pairs, 34 based on Foata normal form. 150/1808 useless extension candidates. Maximal degree in co-relation 7924. Up to 343 conditions per place. [2025-04-29 10:58:36,158 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 264 selfloop transitions, 66 changer transitions 0/337 dead transitions. [2025-04-29 10:58:36,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 337 transitions, 5878 flow [2025-04-29 10:58:36,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:58:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 10:58:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2025-04-29 10:58:36,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6549586776859504 [2025-04-29 10:58:36,161 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 866 flow. Second operand 22 states and 317 transitions. [2025-04-29 10:58:36,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 337 transitions, 5878 flow [2025-04-29 10:58:36,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 337 transitions, 4914 flow, removed 420 selfloop flow, removed 2 redundant places. [2025-04-29 10:58:36,210 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 1342 flow [2025-04-29 10:58:36,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1342, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2025-04-29 10:58:36,211 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2025-04-29 10:58:36,212 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 1342 flow [2025-04-29 10:58:36,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 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-29 10:58:36,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:36,212 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:36,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:58:36,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:36,413 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:36,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1574010507, now seen corresponding path program 5 times [2025-04-29 10:58:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:36,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759144233] [2025-04-29 10:58:36,414 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:58:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:36,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 100 statements into 21 equivalence classes. [2025-04-29 10:58:36,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 10:58:36,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-04-29 10:58:36,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-04-29 10:58:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:36,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759144233] [2025-04-29 10:58:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759144233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:36,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458920437] [2025-04-29 10:58:36,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:58:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:36,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:36,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:58:36,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 100 statements into 21 equivalence classes. [2025-04-29 10:58:36,627 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 10:58:36,627 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-04-29 10:58:36,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:36,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:58:36,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-04-29 10:58:36,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-04-29 10:58:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458920437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:36,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-04-29 10:58:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356077234] [2025-04-29 10:58:36,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:36,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:58:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:36,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:58:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:58:36,893 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-29 10:58:36,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 1342 flow. Second operand has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 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-29 10:58:36,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:36,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-29 10:58:36,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:37,452 INFO L116 PetriNetUnfolderBase]: 1072/3015 cut-off events. [2025-04-29 10:58:37,452 INFO L117 PetriNetUnfolderBase]: For 54205/54554 co-relation queries the response was YES. [2025-04-29 10:58:37,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15704 conditions, 3015 events. 1072/3015 cut-off events. For 54205/54554 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20756 event pairs, 137 based on Foata normal form. 354/3174 useless extension candidates. Maximal degree in co-relation 14451. Up to 945 conditions per place. [2025-04-29 10:58:37,478 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 348 selfloop transitions, 46 changer transitions 0/408 dead transitions. [2025-04-29 10:58:37,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 408 transitions, 5504 flow [2025-04-29 10:58:37,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 10:58:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 10:58:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2025-04-29 10:58:37,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-04-29 10:58:37,480 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 1342 flow. Second operand 16 states and 231 transitions. [2025-04-29 10:58:37,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 408 transitions, 5504 flow [2025-04-29 10:58:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 408 transitions, 5234 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-29 10:58:37,534 INFO L231 Difference]: Finished difference. Result has 141 places, 131 transitions, 1594 flow [2025-04-29 10:58:37,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1594, PETRI_PLACES=141, PETRI_TRANSITIONS=131} [2025-04-29 10:58:37,535 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 121 predicate places. [2025-04-29 10:58:37,536 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 131 transitions, 1594 flow [2025-04-29 10:58:37,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 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-29 10:58:37,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:37,536 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:37,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:37,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:37,740 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:37,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1617080625, now seen corresponding path program 6 times [2025-04-29 10:58:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:37,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484841325] [2025-04-29 10:58:37,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:58:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:37,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 21 equivalence classes. [2025-04-29 10:58:37,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 140 of 140 statements. [2025-04-29 10:58:37,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-29 10:58:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-29 10:58:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:38,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484841325] [2025-04-29 10:58:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484841325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:38,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834857635] [2025-04-29 10:58:38,081 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:58:38,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:38,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:58:38,112 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 21 equivalence classes. [2025-04-29 10:58:38,144 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 140 of 140 statements. [2025-04-29 10:58:38,144 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-29 10:58:38,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:38,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 10:58:38,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-29 10:58:38,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-29 10:58:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834857635] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:38,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 10:58:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020164965] [2025-04-29 10:58:38,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:38,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:58:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:38,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:58:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:58:38,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-29 10:58:38,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 131 transitions, 1594 flow. Second operand has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 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-29 10:58:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:38,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-29 10:58:38,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:39,294 INFO L116 PetriNetUnfolderBase]: 1492/4173 cut-off events. [2025-04-29 10:58:39,294 INFO L117 PetriNetUnfolderBase]: For 96974/97478 co-relation queries the response was YES. [2025-04-29 10:58:39,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23056 conditions, 4173 events. 1492/4173 cut-off events. For 96974/97478 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 29783 event pairs, 179 based on Foata normal form. 356/4256 useless extension candidates. Maximal degree in co-relation 21373. Up to 1323 conditions per place. [2025-04-29 10:58:39,336 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 486 selfloop transitions, 52 changer transitions 0/552 dead transitions. [2025-04-29 10:58:39,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 552 transitions, 7344 flow [2025-04-29 10:58:39,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:58:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 10:58:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 313 transitions. [2025-04-29 10:58:39,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6466942148760331 [2025-04-29 10:58:39,339 INFO L175 Difference]: Start difference. First operand has 141 places, 131 transitions, 1594 flow. Second operand 22 states and 313 transitions. [2025-04-29 10:58:39,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 552 transitions, 7344 flow [2025-04-29 10:58:39,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 552 transitions, 7284 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 10:58:39,422 INFO L231 Difference]: Finished difference. Result has 164 places, 138 transitions, 1832 flow [2025-04-29 10:58:39,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1832, PETRI_PLACES=164, PETRI_TRANSITIONS=138} [2025-04-29 10:58:39,423 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2025-04-29 10:58:39,423 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 138 transitions, 1832 flow [2025-04-29 10:58:39,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 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-29 10:58:39,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:39,423 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:39,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:39,624 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:39,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1490645679, now seen corresponding path program 7 times [2025-04-29 10:58:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:39,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611426422] [2025-04-29 10:58:39,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 10:58:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:39,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-29 10:58:39,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-29 10:58:39,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:39,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:58:39,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 10:58:39,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-29 10:58:39,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-29 10:58:39,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:58:39,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 10:58:39,759 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 10:58:39,760 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-29 10:58:39,762 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-29 10:58:39,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:58:39,763 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-04-29 10:58:39,867 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:58:39,867 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:58:39,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:58:39 BasicIcfg [2025-04-29 10:58:39,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:58:39,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:58:39,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:58:39,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:58:39,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:32" (3/4) ... [2025-04-29 10:58:39,872 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 10:58:39,951 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 47. [2025-04-29 10:58:40,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:58:40,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:58:40,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:58:40,011 INFO L158 Benchmark]: Toolchain (without parser) took 8007.46ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 115.4MB in the beginning and 129.0MB in the end (delta: -13.6MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. [2025-04-29 10:58:40,012 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:40,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.98ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 101.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:58:40,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.95ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:40,013 INFO L158 Benchmark]: Boogie Preprocessor took 24.59ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:40,013 INFO L158 Benchmark]: RCFGBuilder took 252.11ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:58:40,013 INFO L158 Benchmark]: TraceAbstraction took 7358.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 82.8MB in the beginning and 151.7MB in the end (delta: -68.9MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2025-04-29 10:58:40,013 INFO L158 Benchmark]: Witness Printer took 140.23ms. Allocated memory is still 335.5MB. Free memory was 151.7MB in the beginning and 129.0MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 10:58:40,014 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.18ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.98ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 101.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.95ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.59ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.11ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7358.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 82.8MB in the beginning and 151.7MB in the end (delta: -68.9MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 140.23ms. Allocated memory is still 335.5MB. Free memory was 151.7MB in the beginning and 129.0MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] 0 int myglobal; [L34] 0 pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER; [L57] 0 pthread_t mythread; [L58] 0 int i; [L60] FCALL, FORK 0 pthread_create( &mythread, NULL, thread_function_datarace, NULL) VAL [\at(arg, Pre)={0:0}, myglobal=0, mymutex=0, mythread=-1] [L39] 1 int i,j; [L40] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=0, myglobal=0, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=1, myglobal=1, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=2, myglobal=2, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=3, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=4, myglobal=4, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=5, myglobal=5, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=6, myglobal=6, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=7, myglobal=7, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=8, myglobal=8, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=9, myglobal=9, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=10, myglobal=10, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=11, myglobal=11, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=12, myglobal=12, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=13, myglobal=13, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=14, myglobal=14, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=15, myglobal=15, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=16, myglobal=16, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=17, myglobal=17, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=18, myglobal=18, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=19, myglobal=19, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19, mymutex=0] [L40] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19, mymutex=0] [L43] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19, mymutex=0] [L45] 1 j=j+1 [L49] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=20, myglobal=20, mymutex=0] [L40] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, j=20, myglobal=20, mymutex=0] [L60] COND FALSE 0 !(pthread_create( &mythread, NULL, thread_function_datarace, NULL)) [L72] 0 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mymutex=0, mythread=-1] [L72] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mymutex=0, mythread=-1] [L75] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mymutex=0, mythread=-1] [L72] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mymutex=0, mythread=-1] [L72] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mymutex=0, mythread=-1] [L40] COND FALSE 1 !(i<20) [L52] 1 return NULL; [L80] FCALL, JOIN 1 pthread_join ( mythread, NULL ) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mymutex=0, mythread=-1] [L80] COND FALSE 0 !(pthread_join ( mythread, NULL )) [L84] CALL 0 __VERIFIER_assert(myglobal != 40) [L26] COND TRUE 0 !(cond) VAL [\at(arg, Pre)={0:0}, \at(cond, Pre)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=20, myglobal=40, mymutex=0] [L26] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(cond, Pre)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=20, myglobal=40, mymutex=0] - UnprovableResult [Line: 60]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 28 locations, 31 edges, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 4 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 795 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1832occurred in iteration=8, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 1234 ConstructedInterpolants, 0 QuantifiedInterpolants, 3194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 4186/6305 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-29 10:58:40,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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