./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --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.i -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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:16:17,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:16:17,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:16:17,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:16:17,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:16:17,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:16:17,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:16:17,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:16:17,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:16:17,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:16:17,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:16:17,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:16:17,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:16:17,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:16:17,883 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:16:17,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:16:17,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:16:17,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:16:17,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:16:17,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:16:17,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:16:17,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:16:17,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:16:17,886 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-04-30 10:16:18,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:16:18,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:16:18,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:16:18,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:16:18,100 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:16:18,101 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.i [2025-04-30 10:16:19,379 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c069ab2e5/9f4558a6493d4b8d8f1d9bdf6fd39954/FLAG78375d8bf [2025-04-30 10:16:19,623 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:16:19,624 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:16:19,635 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c069ab2e5/9f4558a6493d4b8d8f1d9bdf6fd39954/FLAG78375d8bf [2025-04-30 10:16:20,379 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c069ab2e5/9f4558a6493d4b8d8f1d9bdf6fd39954 [2025-04-30 10:16:20,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:16:20,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:16:20,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:16:20,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:16:20,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:16:20,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2587fa94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20, skipping insertion in model container [2025-04-30 10:16:20,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:16:20,572 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.i[818,831] [2025-04-30 10:16:20,762 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:16:20,771 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:16:20,789 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.i[818,831] [2025-04-30 10:16:20,828 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:16:20,883 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:16:20,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20 WrapperNode [2025-04-30 10:16:20,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:16:20,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:16:20,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:16:20,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:16:20,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,920 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-04-30 10:16:20,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:16:20,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:16:20,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:16:20,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:16:20,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,939 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:16:20,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:16:20,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:16:20,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:16:20,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:16:20,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (1/1) ... [2025-04-30 10:16:20,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:16:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:20,976 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-30 10:16:20,978 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-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-30 10:16:20,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:16:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:16:20,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:16:20,995 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:16:21,103 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:16:21,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:16:21,274 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:16:21,275 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:16:21,552 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:16:21,552 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:16:21,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:16:21 BoogieIcfgContainer [2025-04-30 10:16:21,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:16:21,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:16:21,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:16:21,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:16:21,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:16:20" (1/3) ... [2025-04-30 10:16:21,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:16:21, skipping insertion in model container [2025-04-30 10:16:21,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:16:20" (2/3) ... [2025-04-30 10:16:21,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:16:21, skipping insertion in model container [2025-04-30 10:16:21,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:16:21" (3/3) ... [2025-04-30 10:16:21,563 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-30 10:16:21,573 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:16:21,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 20 locations, 21 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-30 10:16:21,574 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:16:21,605 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:16:21,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2025-04-30 10:16:21,650 INFO L116 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-04-30 10:16:21,652 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:16:21,655 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 26 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-30 10:16:21,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2025-04-30 10:16:21,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2025-04-30 10:16:21,661 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:16:21,672 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;@683f6893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:16:21,672 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-30 10:16:21,678 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:16:21,678 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-30 10:16:21,678 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:16:21,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:21,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:16:21,680 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:21,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash -676615378, now seen corresponding path program 1 times [2025-04-30 10:16:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:21,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254485520] [2025-04-30 10:16:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:16:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:16:21,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:16:21,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:21,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:21,926 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-30 10:16:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:21,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254485520] [2025-04-30 10:16:21,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254485520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:16:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:16:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:16:21,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722174008] [2025-04-30 10:16:21,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:16:21,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:16:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:16:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:16:21,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 22 [2025-04-30 10:16:21,966 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-30 10:16:21,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:21,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 22 [2025-04-30 10:16:21,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:22,007 INFO L116 PetriNetUnfolderBase]: 13/45 cut-off events. [2025-04-30 10:16:22,009 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:16:22,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 45 events. 13/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 3 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 63. Up to 21 conditions per place. [2025-04-30 10:16:22,011 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 12 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-04-30 10:16:22,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 78 flow [2025-04-30 10:16:22,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:16:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:16:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-30 10:16:22,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-04-30 10:16:22,025 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 45 transitions. [2025-04-30 10:16:22,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 78 flow [2025-04-30 10:16:22,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:16:22,031 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2025-04-30 10:16:22,033 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-30 10:16:22,036 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-30 10:16:22,037 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2025-04-30 10:16:22,037 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-30 10:16:22,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:22,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:16:22,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:16:22,038 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:22,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1372913143, now seen corresponding path program 1 times [2025-04-30 10:16:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:22,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559344190] [2025-04-30 10:16:22,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:16:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:22,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:16:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:16:22,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:22,146 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-30 10:16:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:22,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559344190] [2025-04-30 10:16:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559344190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:22,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464668502] [2025-04-30 10:16:22,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:16:22,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:22,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:22,155 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-30 10:16:22,156 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-30 10:16:22,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:16:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:16:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:16:22,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:22,338 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-30 10:16:22,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:16:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464668502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:16:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:16:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-04-30 10:16:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100262199] [2025-04-30 10:16:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:16:22,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:16:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:22,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:16:22,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:16:22,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-30 10:16:22,345 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-30 10:16:22,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:22,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-30 10:16:22,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:22,383 INFO L116 PetriNetUnfolderBase]: 25/80 cut-off events. [2025-04-30 10:16:22,384 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:16:22,385 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-30 10:16:22,386 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 16 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-04-30 10:16:22,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 108 flow [2025-04-30 10:16:22,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:16:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:16:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-30 10:16:22,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-30 10:16:22,388 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 44 transitions. [2025-04-30 10:16:22,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 108 flow [2025-04-30 10:16:22,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:16:22,389 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2025-04-30 10:16:22,390 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-30 10:16:22,390 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-04-30 10:16:22,391 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2025-04-30 10:16:22,391 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-30 10:16:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:22,391 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-30 10:16:22,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:16:22,596 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-30 10:16:22,596 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:22,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1261972290, now seen corresponding path program 1 times [2025-04-30 10:16:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:22,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149855146] [2025-04-30 10:16:22,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:16:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:22,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:16:22,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:16:22,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:22,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:22,692 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-30 10:16:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:22,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149855146] [2025-04-30 10:16:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149855146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:22,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188224646] [2025-04-30 10:16:22,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:16:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:22,694 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-30 10:16:22,696 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-30 10:16:22,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:16:22,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:16:22,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:22,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:22,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:16:22,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:22,832 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-30 10:16:22,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:22,861 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-30 10:16:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188224646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:22,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-30 10:16:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049144898] [2025-04-30 10:16:22,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:22,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:16:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:22,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:16:22,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:16:22,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-30 10:16:22,868 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-30 10:16:22,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:22,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-30 10:16:22,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:22,953 INFO L116 PetriNetUnfolderBase]: 67/174 cut-off events. [2025-04-30 10:16:22,956 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-30 10:16:22,957 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 613 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-30 10:16:22,958 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-04-30 10:16:22,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 46 transitions, 228 flow [2025-04-30 10:16:22,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:16:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:16:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-30 10:16:22,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-04-30 10:16:22,961 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 6 states and 86 transitions. [2025-04-30 10:16:22,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 46 transitions, 228 flow [2025-04-30 10:16:22,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:16:22,963 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 98 flow [2025-04-30 10:16:22,964 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-30 10:16:22,964 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-30 10:16:22,964 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 98 flow [2025-04-30 10:16:22,964 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-30 10:16:22,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:22,965 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-30 10:16:22,970 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-30 10:16:23,165 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-30 10:16:23,165 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:23,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -9645001, now seen corresponding path program 2 times [2025-04-30 10:16:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:23,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277380228] [2025-04-30 10:16:23,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:16:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:23,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:16:23,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:16:23,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:16:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:23,277 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-30 10:16:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:23,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277380228] [2025-04-30 10:16:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277380228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:23,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696541094] [2025-04-30 10:16:23,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:16:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:23,280 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-30 10:16:23,282 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-30 10:16:23,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:16:23,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:16:23,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:16:23,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:23,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:16:23,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:23,467 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-30 10:16:23,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:23,554 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-30 10:16:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696541094] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:23,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-04-30 10:16:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400654231] [2025-04-30 10:16:23,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:23,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:16:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:23,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:16:23,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:16:23,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-30 10:16:23,572 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-30 10:16:23,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:23,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-30 10:16:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:23,972 INFO L116 PetriNetUnfolderBase]: 185/522 cut-off events. [2025-04-30 10:16:23,972 INFO L117 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-04-30 10:16:23,975 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 2269 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-30 10:16:23,977 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 92 selfloop transitions, 69 changer transitions 0/167 dead transitions. [2025-04-30 10:16:23,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 167 transitions, 1092 flow [2025-04-30 10:16:23,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:16:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-30 10:16:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 462 transitions. [2025-04-30 10:16:23,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2025-04-30 10:16:23,983 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 98 flow. Second operand 34 states and 462 transitions. [2025-04-30 10:16:23,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 167 transitions, 1092 flow [2025-04-30 10:16:23,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 167 transitions, 1032 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-04-30 10:16:23,990 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 730 flow [2025-04-30 10:16:23,990 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-30 10:16:23,990 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2025-04-30 10:16:23,991 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 730 flow [2025-04-30 10:16:23,991 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-30 10:16:23,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:23,991 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-30 10:16:23,997 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-30 10:16:24,195 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-30 10:16:24,195 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:24,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1097556566, now seen corresponding path program 3 times [2025-04-30 10:16:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:24,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17203089] [2025-04-30 10:16:24,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:16:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:24,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-04-30 10:16:24,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 50 statements. [2025-04-30 10:16:24,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:16:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:24,274 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-30 10:16:24,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:24,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17203089] [2025-04-30 10:16:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17203089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:24,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848912221] [2025-04-30 10:16:24,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:16:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:24,279 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-30 10:16:24,280 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-30 10:16:24,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-04-30 10:16:24,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 50 statements. [2025-04-30 10:16:24,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:16:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:24,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:16:24,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:24,399 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-30 10:16:24,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:24,430 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-30 10:16:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848912221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:24,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:24,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:16:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978990768] [2025-04-30 10:16:24,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:24,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:16:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:24,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:16:24,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:16:24,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-30 10:16:24,441 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-30 10:16:24,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:24,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-30 10:16:24,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:24,600 INFO L116 PetriNetUnfolderBase]: 286/819 cut-off events. [2025-04-30 10:16:24,601 INFO L117 PetriNetUnfolderBase]: For 13333/13430 co-relation queries the response was YES. [2025-04-30 10:16:24,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3988 conditions, 819 events. 286/819 cut-off events. For 13333/13430 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4371 event pairs, 61 based on Foata normal form. 75/841 useless extension candidates. Maximal degree in co-relation 3407. Up to 246 conditions per place. [2025-04-30 10:16:24,611 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 94 selfloop transitions, 38 changer transitions 0/143 dead transitions. [2025-04-30 10:16:24,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 143 transitions, 1502 flow [2025-04-30 10:16:24,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:16:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:16:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2025-04-30 10:16:24,615 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6534090909090909 [2025-04-30 10:16:24,615 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 730 flow. Second operand 8 states and 115 transitions. [2025-04-30 10:16:24,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 143 transitions, 1502 flow [2025-04-30 10:16:24,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 1416 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-30 10:16:24,639 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 866 flow [2025-04-30 10:16:24,640 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-30 10:16:24,640 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2025-04-30 10:16:24,640 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 866 flow [2025-04-30 10:16:24,640 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-30 10:16:24,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:24,640 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-30 10:16:24,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:16:24,845 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-30 10:16:24,845 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:24,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 824113124, now seen corresponding path program 4 times [2025-04-30 10:16:24,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:24,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000127875] [2025-04-30 10:16:24,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:16:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:24,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-30 10:16:24,879 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:16:24,879 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:16:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:16:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:25,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000127875] [2025-04-30 10:16:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000127875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:25,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826222262] [2025-04-30 10:16:25,037 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:16:25,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:25,039 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-30 10:16:25,040 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-30 10:16:25,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-30 10:16:25,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:16:25,152 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:16:25,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:25,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:16:25,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:16:25,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:16:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826222262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:25,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-04-30 10:16:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681922276] [2025-04-30 10:16:25,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:25,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:16:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:25,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:16:25,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:16:25,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-30 10:16:25,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 866 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-30 10:16:25,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:25,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-30 10:16:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:25,681 INFO L116 PetriNetUnfolderBase]: 630/1747 cut-off events. [2025-04-30 10:16:25,682 INFO L117 PetriNetUnfolderBase]: For 41039/41237 co-relation queries the response was YES. [2025-04-30 10:16:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9558 conditions, 1747 events. 630/1747 cut-off events. For 41039/41237 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 10149 event pairs, 117 based on Foata normal form. 165/1755 useless extension candidates. Maximal degree in co-relation 8104. Up to 534 conditions per place. [2025-04-30 10:16:25,701 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 198 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2025-04-30 10:16:25,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 255 transitions, 2840 flow [2025-04-30 10:16:25,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:16:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:16:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2025-04-30 10:16:25,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-04-30 10:16:25,704 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 866 flow. Second operand 16 states and 231 transitions. [2025-04-30 10:16:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 255 transitions, 2840 flow [2025-04-30 10:16:25,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 255 transitions, 2676 flow, removed 60 selfloop flow, removed 2 redundant places. [2025-04-30 10:16:25,754 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 1088 flow [2025-04-30 10:16:25,755 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=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1088, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-04-30 10:16:25,755 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 98 predicate places. [2025-04-30 10:16:25,755 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 1088 flow [2025-04-30 10:16:25,756 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-30 10:16:25,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:25,756 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:16:25,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:16:25,956 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-30 10:16:25,957 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:25,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1315041992, now seen corresponding path program 5 times [2025-04-30 10:16:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:25,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888909272] [2025-04-30 10:16:25,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:16:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:25,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 15 equivalence classes. [2025-04-30 10:16:25,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 110 of 110 statements. [2025-04-30 10:16:25,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-04-30 10:16:25,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:16:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:26,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888909272] [2025-04-30 10:16:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888909272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:26,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103957758] [2025-04-30 10:16:26,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:16:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:26,220 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-30 10:16:26,222 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-30 10:16:26,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 15 equivalence classes. [2025-04-30 10:16:26,351 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 110 of 110 statements. [2025-04-30 10:16:26,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-04-30 10:16:26,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:26,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:16:26,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:16:26,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:16:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103957758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:26,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-04-30 10:16:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466366970] [2025-04-30 10:16:26,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:26,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:16:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:26,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:16:26,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:16:26,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2025-04-30 10:16:26,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 1088 flow. Second operand has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 states have internal predecessors, (226), 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-30 10:16:26,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:26,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2025-04-30 10:16:26,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:27,298 INFO L116 PetriNetUnfolderBase]: 1295/3419 cut-off events. [2025-04-30 10:16:27,298 INFO L117 PetriNetUnfolderBase]: For 115677/115677 co-relation queries the response was YES. [2025-04-30 10:16:27,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18812 conditions, 3419 events. 1295/3419 cut-off events. For 115677/115677 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 23458 event pairs, 56 based on Foata normal form. 310/3690 useless extension candidates. Maximal degree in co-relation 16980. Up to 783 conditions per place. [2025-04-30 10:16:27,329 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 432 selfloop transitions, 66 changer transitions 0/506 dead transitions. [2025-04-30 10:16:27,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 506 transitions, 10036 flow [2025-04-30 10:16:27,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:16:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:16:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2025-04-30 10:16:27,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6549586776859504 [2025-04-30 10:16:27,331 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 1088 flow. Second operand 22 states and 317 transitions. [2025-04-30 10:16:27,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 506 transitions, 10036 flow [2025-04-30 10:16:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 506 transitions, 9776 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:16:27,414 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 1588 flow [2025-04-30 10:16:27,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1588, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2025-04-30 10:16:27,415 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 125 predicate places. [2025-04-30 10:16:27,416 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 1588 flow [2025-04-30 10:16:27,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.272727272727273) internal successors, (226), 22 states have internal predecessors, (226), 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-30 10:16:27,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:27,416 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-30 10:16:27,424 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-30 10:16:27,617 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-30 10:16:27,617 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:27,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1011464014, now seen corresponding path program 6 times [2025-04-30 10:16:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:27,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203676692] [2025-04-30 10:16:27,619 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:16:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:27,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 21 equivalence classes. [2025-04-30 10:16:27,679 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 140 of 140 statements. [2025-04-30 10:16:27,679 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-30 10:16:27,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:16:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:16:28,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203676692] [2025-04-30 10:16:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203676692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:16:28,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172552851] [2025-04-30 10:16:28,008 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:16:28,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:16:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:16:28,009 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-30 10:16:28,011 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-30 10:16:28,101 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 21 equivalence classes. [2025-04-30 10:16:28,177 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 140 of 140 statements. [2025-04-30 10:16:28,177 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-30 10:16:28,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:16:28,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:16:28,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:16:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:16:28,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:16:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:16:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172552851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:16:28,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:16:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:16:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6924355] [2025-04-30 10:16:28,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:16:28,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:16:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:16:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:16:28,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:16:28,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2025-04-30 10:16:28,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 1588 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-30 10:16:28,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:16:28,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2025-04-30 10:16:28,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:16:29,465 INFO L116 PetriNetUnfolderBase]: 1492/4173 cut-off events. [2025-04-30 10:16:29,466 INFO L117 PetriNetUnfolderBase]: For 98823/99328 co-relation queries the response was YES. [2025-04-30 10:16:29,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23469 conditions, 4173 events. 1492/4173 cut-off events. For 98823/99328 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 29625 event pairs, 179 based on Foata normal form. 356/4256 useless extension candidates. Maximal degree in co-relation 21721. Up to 1323 conditions per place. [2025-04-30 10:16:29,513 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 486 selfloop transitions, 52 changer transitions 0/552 dead transitions. [2025-04-30 10:16:29,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 552 transitions, 7662 flow [2025-04-30 10:16:29,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:16:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:16:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 313 transitions. [2025-04-30 10:16:29,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6466942148760331 [2025-04-30 10:16:29,515 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 1588 flow. Second operand 22 states and 313 transitions. [2025-04-30 10:16:29,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 552 transitions, 7662 flow [2025-04-30 10:16:29,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 552 transitions, 7284 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-30 10:16:29,619 INFO L231 Difference]: Finished difference. Result has 164 places, 138 transitions, 1832 flow [2025-04-30 10:16:29,619 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-30 10:16:29,620 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2025-04-30 10:16:29,620 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 138 transitions, 1832 flow [2025-04-30 10:16:29,620 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-30 10:16:29,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:16:29,621 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-30 10:16:29,627 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-30 10:16:29,825 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-30 10:16:29,825 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:16:29,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:16:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1761730872, now seen corresponding path program 7 times [2025-04-30 10:16:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:16:29,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641293525] [2025-04-30 10:16:29,826 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:16:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:16:29,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-30 10:16:29,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-30 10:16:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:16:29,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:16:29,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-30 10:16:29,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-30 10:16:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:16:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:16:29,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:16:29,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:16:29,980 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-30 10:16:29,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-30 10:16:29,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:16:29,982 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-04-30 10:16:30,127 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:16:30,128 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:16:30,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:16:30 BasicIcfg [2025-04-30 10:16:30,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:16:30,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:16:30,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:16:30,136 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:16:30,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:16:21" (3/4) ... [2025-04-30 10:16:30,137 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:16:30,244 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 47. [2025-04-30 10:16:30,304 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:16:30,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:16:30,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:16:30,305 INFO L158 Benchmark]: Toolchain (without parser) took 9923.93ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 121.1MB in the beginning and 234.1MB in the end (delta: -113.1MB). Peak memory consumption was 258.2MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,306 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:16:30,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.91ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 80.5MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 77.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:16:30,307 INFO L158 Benchmark]: Boogie Preprocessor took 29.75ms. Allocated memory is still 167.8MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,307 INFO L158 Benchmark]: RCFGBuilder took 601.06ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 100.6MB in the end (delta: -25.2MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,308 INFO L158 Benchmark]: TraceAbstraction took 8579.16ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 100.6MB in the beginning and 259.3MB in the end (delta: -158.7MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,308 INFO L158 Benchmark]: Witness Printer took 169.35ms. Allocated memory is still 536.9MB. Free memory was 259.3MB in the beginning and 234.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:16:30,310 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.22ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.91ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 80.5MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 77.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.75ms. Allocated memory is still 167.8MB. Free memory was 77.1MB in the beginning and 75.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 601.06ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 100.6MB in the end (delta: -25.2MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8579.16ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 100.6MB in the beginning and 259.3MB in the end (delta: -158.7MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. * Witness Printer took 169.35ms. Allocated memory is still 536.9MB. Free memory was 259.3MB in the beginning and 234.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\at(arg, Pre)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, j=20, myglobal=20] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1352] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] 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] [L13] 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] - UnprovableResult [Line: 1342]: 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: 8.4s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 6 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 816 SyntacticMatches, 12 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 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.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 2868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1419 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 4075/6407 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-30 10:16:30,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE