./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-1_3-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/ldv-races/race-1_3-join.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 8c7f2059024755e8d2127555397365a96bb56530f6a4795548fd916204307c42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:22:59,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:22:59,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:22:59,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:22:59,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:22:59,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:22:59,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:22:59,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:22:59,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:22:59,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:22:59,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:22:59,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:22:59,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:22:59,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:22:59,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:22:59,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:22:59,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:22:59,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:22:59,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:22:59,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:22:59,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:22:59,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:22:59,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:22:59,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:22:59,872 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 -> 8c7f2059024755e8d2127555397365a96bb56530f6a4795548fd916204307c42 [2025-03-08 17:23:00,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:23:00,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:23:00,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:23:00,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:23:00,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:23:00,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_3-join.i [2025-03-08 17:23:01,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb801499/de3c982877834a1bbb5851e770785926/FLAGe5503b60c [2025-03-08 17:23:01,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:23:01,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_3-join.i [2025-03-08 17:23:01,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb801499/de3c982877834a1bbb5851e770785926/FLAGe5503b60c [2025-03-08 17:23:01,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb801499/de3c982877834a1bbb5851e770785926 [2025-03-08 17:23:01,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:23:01,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:23:01,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:23:01,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:23:01,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:23:01,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce6171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01, skipping insertion in model container [2025-03-08 17:23:01,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:23:02,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_3-join.i[76153,76166] [2025-03-08 17:23:02,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:23:02,306 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:23:02,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_3-join.i[76153,76166] [2025-03-08 17:23:02,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:23:02,454 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:23:02,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02 WrapperNode [2025-03-08 17:23:02,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:23:02,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:23:02,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:23:02,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:23:02,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,512 INFO L138 Inliner]: procedures = 483, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-08 17:23:02,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:23:02,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:23:02,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:23:02,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:23:02,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,542 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 1, 5]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-08 17:23:02,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:23:02,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:23:02,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:23:02,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:23:02,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (1/1) ... [2025-03-08 17:23:02,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:23:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:02,594 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-03-08 17:23:02,596 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-03-08 17:23:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:23:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:23:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:23:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:23:02,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:23:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:23:02,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:23:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:23:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:23:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:23:02,615 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:23:02,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:23:02,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:23:02,983 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:23:02,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:23:03,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:23:03,083 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:23:03,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:03 BoogieIcfgContainer [2025-03-08 17:23:03,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:23:03,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:23:03,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:23:03,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:23:03,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:23:01" (1/3) ... [2025-03-08 17:23:03,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcf5bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:23:03, skipping insertion in model container [2025-03-08 17:23:03,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:02" (2/3) ... [2025-03-08 17:23:03,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcf5bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:23:03, skipping insertion in model container [2025-03-08 17:23:03,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:03" (3/3) ... [2025-03-08 17:23:03,092 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2025-03-08 17:23:03,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:23:03,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_3-join.i that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-08 17:23:03,103 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:23:03,135 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:23:03,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 36 transitions, 79 flow [2025-03-08 17:23:03,185 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-03-08 17:23:03,187 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:23:03,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 42 events. 4/42 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-03-08 17:23:03,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 36 transitions, 79 flow [2025-03-08 17:23:03,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 66 flow [2025-03-08 17:23:03,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:23:03,208 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@2c0e1084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:23:03,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:23:03,212 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:23:03,212 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-08 17:23:03,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:23:03,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:03,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-08 17:23:03,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:23:03,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash 251381, now seen corresponding path program 1 times [2025-03-08 17:23:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019469195] [2025-03-08 17:23:03,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:03,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 17:23:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 17:23:03,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:23:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019469195] [2025-03-08 17:23:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019469195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:23:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358952591] [2025-03-08 17:23:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:23:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:23:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:23:03,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-08 17:23:03,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-03-08 17:23:03,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:03,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-08 17:23:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:03,609 INFO L124 PetriNetUnfolderBase]: 24/75 cut-off events. [2025-03-08 17:23:03,609 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:23:03,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 75 events. 24/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 224 event pairs, 24 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 118. Up to 69 conditions per place. [2025-03-08 17:23:03,611 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 13 selfloop transitions, 4 changer transitions 3/22 dead transitions. [2025-03-08 17:23:03,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 90 flow [2025-03-08 17:23:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:23:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:23:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-08 17:23:03,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2025-03-08 17:23:03,621 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 66 flow. Second operand 3 states and 41 transitions. [2025-03-08 17:23:03,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 90 flow [2025-03-08 17:23:03,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:23:03,626 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 47 flow [2025-03-08 17:23:03,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=47, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2025-03-08 17:23:03,630 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -6 predicate places. [2025-03-08 17:23:03,633 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 47 flow [2025-03-08 17:23:03,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-03-08 17:23:03,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:03,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:23:03,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:23:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 637302173, now seen corresponding path program 1 times [2025-03-08 17:23:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342536544] [2025-03-08 17:23:03,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:03,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:23:03,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:23:03,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:23:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:03,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342536544] [2025-03-08 17:23:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342536544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:23:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852443813] [2025-03-08 17:23:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:23:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:03,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:23:03,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:23:03,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-03-08 17:23:03,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-03-08 17:23:03,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:03,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-03-08 17:23:03,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:03,840 INFO L124 PetriNetUnfolderBase]: 17/60 cut-off events. [2025-03-08 17:23:03,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:23:03,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 60 events. 17/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 14 based on Foata normal form. 6/64 useless extension candidates. Maximal degree in co-relation 101. Up to 48 conditions per place. [2025-03-08 17:23:03,841 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 12 selfloop transitions, 2 changer transitions 6/23 dead transitions. [2025-03-08 17:23:03,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 93 flow [2025-03-08 17:23:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:23:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:23:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-08 17:23:03,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-08 17:23:03,843 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 47 flow. Second operand 3 states and 56 transitions. [2025-03-08 17:23:03,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 93 flow [2025-03-08 17:23:03,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 85 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:23:03,844 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 41 flow [2025-03-08 17:23:03,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2025-03-08 17:23:03,845 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -8 predicate places. [2025-03-08 17:23:03,845 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 41 flow [2025-03-08 17:23:03,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-03-08 17:23:03,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:03,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:23:03,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:23:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash 861017883, now seen corresponding path program 1 times [2025-03-08 17:23:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021890960] [2025-03-08 17:23:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:03,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:23:03,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:23:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:03,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:23:03,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:23:03,928 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:23:03,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-08 17:23:03,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:23:03,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:23:03,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:23:03,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-08 17:23:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:23:03,932 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 17:23:03,956 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:23:03,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:23:03,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:23:03 BasicIcfg [2025-03-08 17:23:03,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:23:03,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:23:03,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:23:03,962 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:23:03,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:03" (3/4) ... [2025-03-08 17:23:03,963 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 17:23:03,996 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-08 17:23:04,036 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:23:04,036 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:23:04,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:23:04,038 INFO L158 Benchmark]: Toolchain (without parser) took 2304.98ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 113.7MB in the end (delta: 7.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-03-08 17:23:04,039 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:04,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.80ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 66.9MB in the end (delta: 54.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 17:23:04,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.76ms. Allocated memory is still 167.8MB. Free memory was 66.9MB in the beginning and 64.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:04,040 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 61.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:04,040 INFO L158 Benchmark]: IcfgBuilder took 517.60ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 115.2MB in the end (delta: -53.5MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-03-08 17:23:04,041 INFO L158 Benchmark]: TraceAbstraction took 875.71ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 120.6MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:04,041 INFO L158 Benchmark]: Witness Printer took 75.26ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 113.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:04,043 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.33ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.80ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 66.9MB in the end (delta: 54.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.76ms. Allocated memory is still 167.8MB. Free memory was 66.9MB in the beginning and 64.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 167.8MB. Free memory was 64.3MB in the beginning and 61.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.60ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 115.2MB in the end (delta: -53.5MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 875.71ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 120.6MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 75.26ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 113.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL, EXPR 0 module_init() [L1709] 0 pdev = 1 [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={3:0}, pdev=1, t1=0] [L1710] RET 0 ldv_assert(pdev==1) [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [\old(arg)={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1713] 0 return 0; VAL [\old(arg)={0:0}, \result=0, arg={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1734] RET, EXPR 0 module_init() [L1734] COND FALSE 0 !(module_init()!=0) [L1735] CALL 0 module_exit() [L1721] 0 void *status; VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=1, status={5:0}, t1=-1] [L1723] 0 pdev = 4 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=4, status={5:0}, t1=-1] [L1702] 1 pdev = 6 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] [L1726] CALL 0 ldv_assert(pdev==4) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, arg={0:0}, expression=0, mutex={3:0}, pdev=6, t1=-1] - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: 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, 40 locations, 44 edges, 5 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: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 6, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 17:23:04,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE