./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:55,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:55,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:58:55,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:55,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:55,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:55,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:55,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:55,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:55,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:55,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:55,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:55,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:55,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:55,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:55,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:55,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:55,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:55,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:55,517 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-jdk21/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-01-10 00:58:55,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:55,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:55,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:55,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:55,731 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:55,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-01-10 00:58:56,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0d35228b/90b9000887bb4ac1a5385e2d35ce8368/FLAG4532f5d50 [2025-01-10 00:58:57,074 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:57,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-01-10 00:58:57,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0d35228b/90b9000887bb4ac1a5385e2d35ce8368/FLAG4532f5d50 [2025-01-10 00:58:57,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0d35228b/90b9000887bb4ac1a5385e2d35ce8368 [2025-01-10 00:58:57,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:57,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:57,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:57,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:57,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:57,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0ceb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57, skipping insertion in model container [2025-01-10 00:58:57,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:58:57,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:57,664 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:58:57,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:57,728 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:58:57,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57 WrapperNode [2025-01-10 00:58:57,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:57,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:57,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:58:57,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:58:57,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,765 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 155 [2025-01-10 00:58:57,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:57,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:58:57,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:58:57,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:58:57,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,795 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-10 00:58:57,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:58:57,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:58:57,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:58:57,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:58:57,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (1/1) ... [2025-01-10 00:58:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:58:57,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:58:57,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:58:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:58:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:58:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:58:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:58:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:58:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:58:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:58:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:58:57,856 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:58:57,946 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:58:57,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:58:58,164 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:58:58,165 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:58:58,268 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:58:58,268 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-10 00:58:58,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:58 BoogieIcfgContainer [2025-01-10 00:58:58,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:58:58,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:58:58,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:58:58,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:58:58,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:57" (1/3) ... [2025-01-10 00:58:58,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506de23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:58, skipping insertion in model container [2025-01-10 00:58:58,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:57" (2/3) ... [2025-01-10 00:58:58,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506de23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:58, skipping insertion in model container [2025-01-10 00:58:58,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:58" (3/3) ... [2025-01-10 00:58:58,275 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-01-10 00:58:58,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:58:58,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 76 locations, 1 initial locations, 10 loop locations, and 7 error locations. [2025-01-10 00:58:58,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:58:58,316 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:58:58,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 98 transitions, 203 flow [2025-01-10 00:58:58,392 INFO L124 PetriNetUnfolderBase]: 32/147 cut-off events. [2025-01-10 00:58:58,395 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:58,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 147 events. 32/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 663 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2025-01-10 00:58:58,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 98 transitions, 203 flow [2025-01-10 00:58:58,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 203 flow [2025-01-10 00:58:58,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:58,422 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=None, 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;@5db325f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:58,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 00:58:58,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:58,428 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:58,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:58,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:58,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:58,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:58,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 461718, now seen corresponding path program 1 times [2025-01-10 00:58:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:58,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231460050] [2025-01-10 00:58:58,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231460050] [2025-01-10 00:58:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231460050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:58,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:58,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457934272] [2025-01-10 00:58:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:58,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:58,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 98 [2025-01-10 00:58:58,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-10 00:58:58,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:58,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 98 [2025-01-10 00:58:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:58,903 INFO L124 PetriNetUnfolderBase]: 338/1050 cut-off events. [2025-01-10 00:58:58,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:58,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1050 events. 338/1050 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6571 event pairs, 285 based on Foata normal form. 266/1278 useless extension candidates. Maximal degree in co-relation 1682. Up to 635 conditions per place. [2025-01-10 00:58:58,914 INFO L140 encePairwiseOnDemand]: 74/98 looper letters, 53 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-01-10 00:58:58,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 295 flow [2025-01-10 00:58:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-01-10 00:58:58,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 00:58:58,927 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 203 flow. Second operand 3 states and 189 transitions. [2025-01-10 00:58:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 295 flow [2025-01-10 00:58:58,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 295 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:58,934 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 159 flow [2025-01-10 00:58:58,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2025-01-10 00:58:58,938 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2025-01-10 00:58:58,938 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 159 flow [2025-01-10 00:58:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-10 00:58:58,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:58,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:58:58,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 461719, now seen corresponding path program 1 times [2025-01-10 00:58:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-01-10 00:58:58,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:58,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:58,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:58,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-01-10 00:58:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174974952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:59,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:59,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180950138] [2025-01-10 00:58:59,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:59,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:59,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:59,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 98 [2025-01-10 00:58:59,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-01-10 00:58:59,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:59,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 98 [2025-01-10 00:58:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:59,236 INFO L124 PetriNetUnfolderBase]: 321/1000 cut-off events. [2025-01-10 00:58:59,236 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:58:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1000 events. 321/1000 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6110 event pairs, 266 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 1645. Up to 636 conditions per place. [2025-01-10 00:58:59,241 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 53 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-10 00:58:59,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 90 transitions, 301 flow [2025-01-10 00:58:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 00:58:59,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:58:59,243 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 159 flow. Second operand 3 states and 168 transitions. [2025-01-10 00:58:59,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 90 transitions, 301 flow [2025-01-10 00:58:59,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:59,248 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 165 flow [2025-01-10 00:58:59,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-01-10 00:58:59,249 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2025-01-10 00:58:59,249 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 165 flow [2025-01-10 00:58:59,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-01-10 00:58:59,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:59,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:59,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:58:59,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:59,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1219977391, now seen corresponding path program 1 times [2025-01-10 00:58:59,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:59,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-01-10 00:58:59,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:59,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:59,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:59,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:59,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-01-10 00:58:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230831997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:59,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-01-10 00:58:59,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:59,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:59,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:59,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:59,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 98 [2025-01-10 00:58:59,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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-01-10 00:58:59,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:59,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 98 [2025-01-10 00:58:59,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:59,528 INFO L124 PetriNetUnfolderBase]: 46/145 cut-off events. [2025-01-10 00:58:59,529 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:58:59,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 145 events. 46/145 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 604 event pairs, 0 based on Foata normal form. 32/171 useless extension candidates. Maximal degree in co-relation 265. Up to 93 conditions per place. [2025-01-10 00:58:59,530 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 35 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 00:58:59,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 194 flow [2025-01-10 00:58:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-01-10 00:58:59,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2025-01-10 00:58:59,533 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 165 flow. Second operand 4 states and 183 transitions. [2025-01-10 00:58:59,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 194 flow [2025-01-10 00:58:59,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:59,535 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 84 flow [2025-01-10 00:58:59,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-10 00:58:59,535 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -36 predicate places. [2025-01-10 00:58:59,535 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 84 flow [2025-01-10 00:58:59,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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-01-10 00:58:59,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:59,536 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:58:59,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:58:59,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:59,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash -835406070, now seen corresponding path program 1 times [2025-01-10 00:58:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:59,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141006218] [2025-01-10 00:58:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:59,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:59,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:59,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:59,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:59,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:59,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:59,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:59,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:59,583 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:59,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 00:58:59,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-01-10 00:58:59,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-01-10 00:58:59,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-10 00:58:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:58:59,586 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:58:59,589 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:59,590 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:58:59,610 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:58:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 143 transitions, 302 flow [2025-01-10 00:58:59,628 INFO L124 PetriNetUnfolderBase]: 55/253 cut-off events. [2025-01-10 00:58:59,628 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:58:59,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 253 events. 55/253 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1261 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 151. Up to 9 conditions per place. [2025-01-10 00:58:59,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 143 transitions, 302 flow [2025-01-10 00:58:59,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 143 transitions, 302 flow [2025-01-10 00:58:59,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:59,635 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=None, 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;@5db325f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:59,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 00:58:59,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:59,636 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:59,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:59,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:59,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:59,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash 603717, now seen corresponding path program 1 times [2025-01-10 00:58:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543655737] [2025-01-10 00:58:59,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:59,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:59,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:59,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543655737] [2025-01-10 00:58:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543655737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670131049] [2025-01-10 00:58:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:59,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:59,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 143 [2025-01-10 00:58:59,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 143 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-10 00:58:59,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:59,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 143 [2025-01-10 00:58:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:01,218 INFO L124 PetriNetUnfolderBase]: 11475/23376 cut-off events. [2025-01-10 00:59:01,219 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-01-10 00:59:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40793 conditions, 23376 events. 11475/23376 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 220197 event pairs, 9705 based on Foata normal form. 6815/29358 useless extension candidates. Maximal degree in co-relation 16441. Up to 15663 conditions per place. [2025-01-10 00:59:01,331 INFO L140 encePairwiseOnDemand]: 109/143 looper letters, 85 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-01-10 00:59:01,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 138 transitions, 466 flow [2025-01-10 00:59:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-01-10 00:59:01,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6806526806526807 [2025-01-10 00:59:01,335 INFO L175 Difference]: Start difference. First operand has 114 places, 143 transitions, 302 flow. Second operand 3 states and 292 transitions. [2025-01-10 00:59:01,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 138 transitions, 466 flow [2025-01-10 00:59:01,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 138 transitions, 466 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:01,340 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 236 flow [2025-01-10 00:59:01,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-01-10 00:59:01,343 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-01-10 00:59:01,343 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 236 flow [2025-01-10 00:59:01,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-10 00:59:01,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:01,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:01,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:01,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:59:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 603718, now seen corresponding path program 1 times [2025-01-10 00:59:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596816077] [2025-01-10 00:59:01,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:01,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:01,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:01,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:01,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596816077] [2025-01-10 00:59:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596816077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:01,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:01,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964588489] [2025-01-10 00:59:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:01,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:01,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:01,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:01,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 143 [2025-01-10 00:59:01,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-01-10 00:59:01,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:01,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 143 [2025-01-10 00:59:01,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:02,772 INFO L124 PetriNetUnfolderBase]: 10930/22799 cut-off events. [2025-01-10 00:59:02,773 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-10 00:59:02,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39672 conditions, 22799 events. 10930/22799 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 216904 event pairs, 9844 based on Foata normal form. 1/21767 useless extension candidates. Maximal degree in co-relation 35754. Up to 16477 conditions per place. [2025-01-10 00:59:02,862 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 71 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-01-10 00:59:02,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 125 transitions, 416 flow [2025-01-10 00:59:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-01-10 00:59:02,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5524475524475524 [2025-01-10 00:59:02,864 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 236 flow. Second operand 3 states and 237 transitions. [2025-01-10 00:59:02,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 125 transitions, 416 flow [2025-01-10 00:59:02,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 125 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:02,884 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 246 flow [2025-01-10 00:59:02,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2025-01-10 00:59:02,887 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -2 predicate places. [2025-01-10 00:59:02,887 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 246 flow [2025-01-10 00:59:02,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-01-10 00:59:02,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:59:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:02,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:59:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -779267181, now seen corresponding path program 1 times [2025-01-10 00:59:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-01-10 00:59:02,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:59:02,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:59:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804660131] [2025-01-10 00:59:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804660131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:59:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534989677] [2025-01-10 00:59:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:02,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:02,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:03,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 143 [2025-01-10 00:59:03,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 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-01-10 00:59:03,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 143 [2025-01-10 00:59:03,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,137 INFO L124 PetriNetUnfolderBase]: 10395/21312 cut-off events. [2025-01-10 00:59:04,137 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-01-10 00:59:04,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37760 conditions, 21312 events. 10395/21312 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 197997 event pairs, 4821 based on Foata normal form. 288/21046 useless extension candidates. Maximal degree in co-relation 35276. Up to 12946 conditions per place. [2025-01-10 00:59:04,236 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 130 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-01-10 00:59:04,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 186 transitions, 668 flow [2025-01-10 00:59:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:59:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:59:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-01-10 00:59:04,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5622377622377622 [2025-01-10 00:59:04,238 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 246 flow. Second operand 5 states and 402 transitions. [2025-01-10 00:59:04,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 186 transitions, 668 flow [2025-01-10 00:59:04,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 186 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:04,242 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 257 flow [2025-01-10 00:59:04,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2025-01-10 00:59:04,242 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 00:59:04,242 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 257 flow [2025-01-10 00:59:04,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 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-01-10 00:59:04,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:59:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:04,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:59:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -518626380, now seen corresponding path program 1 times [2025-01-10 00:59:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-01-10 00:59:04,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:59:04,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:59:04,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:04,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:04,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:59:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:59:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:04,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:04,271 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:04,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2025-01-10 00:59:04,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-01-10 00:59:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:04,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:59:04,273 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:04,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:59:04,303 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:59:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 188 transitions, 403 flow [2025-01-10 00:59:04,335 INFO L124 PetriNetUnfolderBase]: 81/380 cut-off events. [2025-01-10 00:59:04,335 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 00:59:04,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 380 events. 81/380 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2005 event pairs, 1 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 264. Up to 12 conditions per place. [2025-01-10 00:59:04,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 188 transitions, 403 flow [2025-01-10 00:59:04,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 188 transitions, 403 flow [2025-01-10 00:59:04,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:04,344 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=None, 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;@5db325f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:04,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 00:59:04,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:04,346 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:59:04,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:04,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:59:04,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-01-10 00:59:04,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash 790401, now seen corresponding path program 1 times [2025-01-10 00:59:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-01-10 00:59:04,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:59:04,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:59:04,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:04,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-01-10 00:59:04,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895212234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:04,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:04,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:04,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154908264] [2025-01-10 00:59:04,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:04,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:04,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 188 [2025-01-10 00:59:04,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 188 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-01-10 00:59:04,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 188 [2025-01-10 00:59:04,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:30,032 INFO L124 PetriNetUnfolderBase]: 283713/478855 cut-off events. [2025-01-10 00:59:30,032 INFO L125 PetriNetUnfolderBase]: For 3094/3094 co-relation queries the response was YES. [2025-01-10 00:59:30,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858607 conditions, 478855 events. 283713/478855 cut-off events. For 3094/3094 co-relation queries the response was YES. Maximal size of possible extension queue 10397. Compared 5351544 event pairs, 239686 based on Foata normal form. 151975/615183 useless extension candidates. Maximal degree in co-relation 130424. Up to 340236 conditions per place.