./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 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 f4443c7da5298ac603586799640102b5bfbd455269f211f15877108d6d955b4a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:41,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:42,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:42,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:42,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:42,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:42,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:42,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:42,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:42,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:42,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:42,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:42,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:42,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:42,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:42,033 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:42,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:42,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:42,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:42,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:42,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:42,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:42,036 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 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 -> f4443c7da5298ac603586799640102b5bfbd455269f211f15877108d6d955b4a [2025-04-29 11:15:42,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:42,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:42,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:42,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:42,270 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:42,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c [2025-04-29 11:15:43,604 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec0bfd93/208c066072ad425e88d7caccc03a5680/FLAG31532ed10 [2025-04-29 11:15:43,790 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:43,791 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c [2025-04-29 11:15:43,793 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:43,793 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:43,798 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec0bfd93/208c066072ad425e88d7caccc03a5680/FLAG31532ed10 [2025-04-29 11:15:44,805 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec0bfd93/208c066072ad425e88d7caccc03a5680 [2025-04-29 11:15:44,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:44,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:44,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:44,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:44,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:44,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:44" (1/1) ... [2025-04-29 11:15:44,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db52a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:44, skipping insertion in model container [2025-04-29 11:15:44,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:44" (1/1) ... [2025-04-29 11:15:44,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:44,980 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:44,989 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:45,014 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:45,028 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:45,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45 WrapperNode [2025-04-29 11:15:45,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:45,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:45,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:45,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:45,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,056 INFO L138 Inliner]: procedures = 12, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2025-04-29 11:15:45,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:45,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:45,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:45,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:45,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,078 INFO L175 MemorySlicer]: Split 24 memory accesses to 1 slices as follows [24]. 100 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [20]. The 2 writes are split as follows [2]. [2025-04-29 11:15:45,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:45,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:45,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:45,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:45,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (1/1) ... [2025-04-29 11:15:45,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:45,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:15:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:45,135 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:15:45,195 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:45,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:45,354 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:45,354 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:45,466 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:45,466 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:45,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:45 BoogieIcfgContainer [2025-04-29 11:15:45,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:45,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:45,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:45,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:45,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:44" (1/3) ... [2025-04-29 11:15:45,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c24db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:45, skipping insertion in model container [2025-04-29 11:15:45,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:45" (2/3) ... [2025-04-29 11:15:45,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c24db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:45, skipping insertion in model container [2025-04-29 11:15:45,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:45" (3/3) ... [2025-04-29 11:15:45,474 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.c [2025-04-29 11:15:45,484 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:45,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.c that has 2 procedures, 31 locations, 32 edges, 1 initial locations, 3 loop locations, and 9 error locations. [2025-04-29 11:15:45,485 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:45,516 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:45,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 70 flow [2025-04-29 11:15:45,566 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-29 11:15:45,568 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:45,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-04-29 11:15:45,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 70 flow [2025-04-29 11:15:45,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 67 flow [2025-04-29 11:15:45,577 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:45,591 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3060a5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:45,591 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:15:45,598 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:45,598 INFO L116 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-04-29 11:15:45,599 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:45,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:45,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:15:45,601 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:45,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash -863479048, now seen corresponding path program 1 times [2025-04-29 11:15:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:45,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205946603] [2025-04-29 11:15:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:45,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:15:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:15:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:45,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:45,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205946603] [2025-04-29 11:15:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205946603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:45,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651933956] [2025-04-29 11:15:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:45,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:45,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:45,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:45,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-04-29 11:15:45,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:45,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:45,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-04-29 11:15:45,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:45,868 INFO L116 PetriNetUnfolderBase]: 74/203 cut-off events. [2025-04-29 11:15:45,868 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:45,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 203 events. 74/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 907 event pairs, 56 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 342. Up to 149 conditions per place. [2025-04-29 11:15:45,870 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-04-29 11:15:45,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 113 flow [2025-04-29 11:15:45,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-29 11:15:45,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-04-29 11:15:45,884 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 67 flow. Second operand 3 states and 59 transitions. [2025-04-29 11:15:45,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 113 flow [2025-04-29 11:15:45,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:45,889 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 78 flow [2025-04-29 11:15:45,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-04-29 11:15:45,895 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-04-29 11:15:45,895 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 78 flow [2025-04-29 11:15:45,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:45,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:45,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:45,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:45,896 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:45,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1067364838, now seen corresponding path program 1 times [2025-04-29 11:15:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:45,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373600413] [2025-04-29 11:15:45,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:45,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:15:45,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:15:45,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:45,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:45,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373600413] [2025-04-29 11:15:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373600413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:45,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819740814] [2025-04-29 11:15:45,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:45,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:45,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:45,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:15:46,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:15:46,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:15:46,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:15:46,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:15:46,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:15:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819740814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:46,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:15:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-04-29 11:15:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268284911] [2025-04-29 11:15:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:46,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:46,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:46,047 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-04-29 11:15:46,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:46,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:46,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-04-29 11:15:46,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:46,193 INFO L116 PetriNetUnfolderBase]: 122/334 cut-off events. [2025-04-29 11:15:46,194 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:46,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 334 events. 122/334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1486 event pairs, 61 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 579. Up to 150 conditions per place. [2025-04-29 11:15:46,197 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 34 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-04-29 11:15:46,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 178 flow [2025-04-29 11:15:46,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-29 11:15:46,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-04-29 11:15:46,200 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 72 transitions. [2025-04-29 11:15:46,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 178 flow [2025-04-29 11:15:46,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 174 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:46,201 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 86 flow [2025-04-29 11:15:46,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-04-29 11:15:46,202 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-04-29 11:15:46,202 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 86 flow [2025-04-29 11:15:46,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:46,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:46,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:46,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:46,407 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:46,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 774098974, now seen corresponding path program 1 times [2025-04-29 11:15:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:46,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28951871] [2025-04-29 11:15:46,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:46,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:46,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:46,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:46,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28951871] [2025-04-29 11:15:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28951871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:46,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125477430] [2025-04-29 11:15:46,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:46,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:15:46,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:46,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:46,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:15:46,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:46,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125477430] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:46,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-29 11:15:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808865215] [2025-04-29 11:15:46,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:46,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:46,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:46,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-04-29 11:15:46,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:46,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:46,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-04-29 11:15:46,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:46,661 INFO L116 PetriNetUnfolderBase]: 122/341 cut-off events. [2025-04-29 11:15:46,661 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 11:15:46,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 341 events. 122/341 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1530 event pairs, 98 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 617. Up to 245 conditions per place. [2025-04-29 11:15:46,666 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 21 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2025-04-29 11:15:46,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 150 flow [2025-04-29 11:15:46,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:15:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2025-04-29 11:15:46,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2025-04-29 11:15:46,668 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 86 flow. Second operand 6 states and 100 transitions. [2025-04-29 11:15:46,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 150 flow [2025-04-29 11:15:46,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:46,669 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 120 flow [2025-04-29 11:15:46,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-04-29 11:15:46,669 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-04-29 11:15:46,669 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 120 flow [2025-04-29 11:15:46,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:46,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:46,669 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:46,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:46,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-29 11:15:46,870 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:46,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash 983807484, now seen corresponding path program 2 times [2025-04-29 11:15:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:46,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605371595] [2025-04-29 11:15:46,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:46,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-29 11:15:46,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-04-29 11:15:46,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:46,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605371595] [2025-04-29 11:15:47,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605371595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:47,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:47,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655991866] [2025-04-29 11:15:47,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:47,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:47,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:47,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:47,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,198 INFO L116 PetriNetUnfolderBase]: 242/600 cut-off events. [2025-04-29 11:15:47,198 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-29 11:15:47,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 600 events. 242/600 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2958 event pairs, 108 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 1146. Up to 308 conditions per place. [2025-04-29 11:15:47,202 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-04-29 11:15:47,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 296 flow [2025-04-29 11:15:47,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-29 11:15:47,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-29 11:15:47,204 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 120 flow. Second operand 5 states and 100 transitions. [2025-04-29 11:15:47,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 296 flow [2025-04-29 11:15:47,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 282 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:47,207 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 132 flow [2025-04-29 11:15:47,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-04-29 11:15:47,208 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2025-04-29 11:15:47,209 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 132 flow [2025-04-29 11:15:47,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,209 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:15:47,210 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:47,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 983807483, now seen corresponding path program 1 times [2025-04-29 11:15:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503589009] [2025-04-29 11:15:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:47,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503589009] [2025-04-29 11:15:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503589009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466439223] [2025-04-29 11:15:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:47,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:47,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:47,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,381 INFO L116 PetriNetUnfolderBase]: 212/521 cut-off events. [2025-04-29 11:15:47,381 INFO L117 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-04-29 11:15:47,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 521 events. 212/521 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2441 event pairs, 42 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1149. Up to 300 conditions per place. [2025-04-29 11:15:47,384 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2025-04-29 11:15:47,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 232 flow [2025-04-29 11:15:47,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-29 11:15:47,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-04-29 11:15:47,385 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 132 flow. Second operand 4 states and 72 transitions. [2025-04-29 11:15:47,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 232 flow [2025-04-29 11:15:47,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:47,388 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 134 flow [2025-04-29 11:15:47,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-04-29 11:15:47,389 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2025-04-29 11:15:47,389 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 134 flow [2025-04-29 11:15:47,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,390 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:47,390 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:47,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 969256441, now seen corresponding path program 1 times [2025-04-29 11:15:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043560575] [2025-04-29 11:15:47,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043560575] [2025-04-29 11:15:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043560575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894919052] [2025-04-29 11:15:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:47,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:47,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:47,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:47,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,555 INFO L116 PetriNetUnfolderBase]: 212/535 cut-off events. [2025-04-29 11:15:47,555 INFO L117 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-04-29 11:15:47,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 535 events. 212/535 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2629 event pairs, 52 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 1186. Up to 280 conditions per place. [2025-04-29 11:15:47,559 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-04-29 11:15:47,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 248 flow [2025-04-29 11:15:47,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-29 11:15:47,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-04-29 11:15:47,561 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 134 flow. Second operand 4 states and 71 transitions. [2025-04-29 11:15:47,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 248 flow [2025-04-29 11:15:47,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:47,563 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 128 flow [2025-04-29 11:15:47,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2025-04-29 11:15:47,564 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2025-04-29 11:15:47,565 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 128 flow [2025-04-29 11:15:47,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,565 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:15:47,565 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:47,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash 969256442, now seen corresponding path program 1 times [2025-04-29 11:15:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38259560] [2025-04-29 11:15:47,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:47,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:47,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38259560] [2025-04-29 11:15:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38259560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:47,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115157586] [2025-04-29 11:15:47,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:47,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:47,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:15:47,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:47,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:15:47,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:47,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:47,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115157586] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:47,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:47,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-29 11:15:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066022729] [2025-04-29 11:15:47,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:15:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:15:47,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:15:47,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-04-29 11:15:47,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 128 flow. Second operand has 13 states, 13 states have (on average 13.384615384615385) internal successors, (174), 13 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-04-29 11:15:47,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,826 INFO L116 PetriNetUnfolderBase]: 212/519 cut-off events. [2025-04-29 11:15:47,826 INFO L117 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-04-29 11:15:47,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 519 events. 212/519 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2325 event pairs, 182 based on Foata normal form. 6/509 useless extension candidates. Maximal degree in co-relation 1180. Up to 425 conditions per place. [2025-04-29 11:15:47,829 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 23 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2025-04-29 11:15:47,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 41 transitions, 232 flow [2025-04-29 11:15:47,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2025-04-29 11:15:47,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45707070707070707 [2025-04-29 11:15:47,830 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 128 flow. Second operand 12 states and 181 transitions. [2025-04-29 11:15:47,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 41 transitions, 232 flow [2025-04-29 11:15:47,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:47,832 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 204 flow [2025-04-29 11:15:47,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=204, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2025-04-29 11:15:47,833 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-04-29 11:15:47,833 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 204 flow [2025-04-29 11:15:47,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.384615384615385) internal successors, (174), 13 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,833 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:15:48,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:48,034 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:48,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 357309114, now seen corresponding path program 2 times [2025-04-29 11:15:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:48,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190362157] [2025-04-29 11:15:48,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:48,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:15:48,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-04-29 11:15:48,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:48,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:48,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190362157] [2025-04-29 11:15:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190362157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:48,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:48,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811391370] [2025-04-29 11:15:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:48,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:48,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:48,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:48,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:48,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:48,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:48,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:48,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:48,250 INFO L116 PetriNetUnfolderBase]: 240/540 cut-off events. [2025-04-29 11:15:48,250 INFO L117 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-04-29 11:15:48,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 540 events. 240/540 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2401 event pairs, 130 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 1201. Up to 322 conditions per place. [2025-04-29 11:15:48,253 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 57 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-29 11:15:48,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 404 flow [2025-04-29 11:15:48,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-29 11:15:48,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-04-29 11:15:48,254 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 204 flow. Second operand 5 states and 97 transitions. [2025-04-29 11:15:48,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 404 flow [2025-04-29 11:15:48,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 356 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-29 11:15:48,259 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 176 flow [2025-04-29 11:15:48,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-04-29 11:15:48,259 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-04-29 11:15:48,261 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 176 flow [2025-04-29 11:15:48,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:48,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:48,261 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:48,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:15:48,261 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:48,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 58025995, now seen corresponding path program 1 times [2025-04-29 11:15:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:48,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604687435] [2025-04-29 11:15:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:48,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:15:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:15:48,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-29 11:15:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:48,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604687435] [2025-04-29 11:15:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604687435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132351591] [2025-04-29 11:15:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:48,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:48,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:48,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:48,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-04-29 11:15:48,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:48,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:48,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-04-29 11:15:48,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:48,376 INFO L116 PetriNetUnfolderBase]: 212/508 cut-off events. [2025-04-29 11:15:48,376 INFO L117 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2025-04-29 11:15:48,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 508 events. 212/508 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2247 event pairs, 182 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1219. Up to 434 conditions per place. [2025-04-29 11:15:48,378 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 34 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-04-29 11:15:48,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 41 transitions, 244 flow [2025-04-29 11:15:48,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-29 11:15:48,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-29 11:15:48,379 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 176 flow. Second operand 3 states and 55 transitions. [2025-04-29 11:15:48,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 41 transitions, 244 flow [2025-04-29 11:15:48,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 41 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:48,381 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 170 flow [2025-04-29 11:15:48,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-04-29 11:15:48,382 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2025-04-29 11:15:48,382 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 170 flow [2025-04-29 11:15:48,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:48,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:48,382 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:48,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:15:48,382 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -71620147, now seen corresponding path program 1 times [2025-04-29 11:15:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:48,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802761799] [2025-04-29 11:15:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:48,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:48,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:15:48,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:48,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802761799] [2025-04-29 11:15:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802761799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:48,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719738225] [2025-04-29 11:15:48,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:48,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:48,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:48,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:48,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:15:48,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:15:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:15:48,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:48,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719738225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:48,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-29 11:15:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949656163] [2025-04-29 11:15:48,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:48,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:15:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:15:48,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:15:48,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:48,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:48,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:48,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:48,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:49,350 INFO L116 PetriNetUnfolderBase]: 478/1044 cut-off events. [2025-04-29 11:15:49,350 INFO L117 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-04-29 11:15:49,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1044 events. 478/1044 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4471 event pairs, 78 based on Foata normal form. 140/1150 useless extension candidates. Maximal degree in co-relation 2484. Up to 210 conditions per place. [2025-04-29 11:15:49,356 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 136 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2025-04-29 11:15:49,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 152 transitions, 824 flow [2025-04-29 11:15:49,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions. [2025-04-29 11:15:49,358 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-04-29 11:15:49,359 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 170 flow. Second operand 12 states and 248 transitions. [2025-04-29 11:15:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 152 transitions, 824 flow [2025-04-29 11:15:49,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:49,362 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 248 flow [2025-04-29 11:15:49,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2025-04-29 11:15:49,363 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2025-04-29 11:15:49,364 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 248 flow [2025-04-29 11:15:49,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:49,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:49,364 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:49,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:49,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:49,565 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:49,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1466314594, now seen corresponding path program 1 times [2025-04-29 11:15:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:49,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999496520] [2025-04-29 11:15:49,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:49,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:49,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:15:49,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:49,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:49,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999496520] [2025-04-29 11:15:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999496520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:49,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609015578] [2025-04-29 11:15:49,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:49,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:49,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:15:49,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:15:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:15:49,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:49,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:50,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609015578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:50,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-29 11:15:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398532090] [2025-04-29 11:15:50,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:50,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:15:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:50,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:15:50,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:15:50,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 47 transitions, 248 flow. Second operand has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:50,668 INFO L116 PetriNetUnfolderBase]: 1091/2372 cut-off events. [2025-04-29 11:15:50,668 INFO L117 PetriNetUnfolderBase]: For 2739/2739 co-relation queries the response was YES. [2025-04-29 11:15:50,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 2372 events. 1091/2372 cut-off events. For 2739/2739 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12630 event pairs, 160 based on Foata normal form. 231/2570 useless extension candidates. Maximal degree in co-relation 6417. Up to 410 conditions per place. [2025-04-29 11:15:50,680 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 215 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2025-04-29 11:15:50,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 230 transitions, 1762 flow [2025-04-29 11:15:50,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2025-04-29 11:15:50,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2025-04-29 11:15:50,683 INFO L175 Difference]: Start difference. First operand has 75 places, 47 transitions, 248 flow. Second operand 12 states and 257 transitions. [2025-04-29 11:15:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 230 transitions, 1762 flow [2025-04-29 11:15:50,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 230 transitions, 1541 flow, removed 80 selfloop flow, removed 4 redundant places. [2025-04-29 11:15:50,691 INFO L231 Difference]: Finished difference. Result has 88 places, 53 transitions, 304 flow [2025-04-29 11:15:50,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=304, PETRI_PLACES=88, PETRI_TRANSITIONS=53} [2025-04-29 11:15:50,692 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2025-04-29 11:15:50,692 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 53 transitions, 304 flow [2025-04-29 11:15:50,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:50,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:50,692 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-29 11:15:50,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:15:50,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:15:50,893 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:50,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1540026820, now seen corresponding path program 2 times [2025-04-29 11:15:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:50,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784116497] [2025-04-29 11:15:50,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:50,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:50,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:50,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:51,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784116497] [2025-04-29 11:15:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784116497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:51,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038648762] [2025-04-29 11:15:51,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:51,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:15:51,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:51,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:51,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:51,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:51,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:15:51,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:51,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038648762] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:51,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-29 11:15:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714501735] [2025-04-29 11:15:51,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:51,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:51,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:51,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:51,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:51,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 53 transitions, 304 flow. Second operand has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:51,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:51,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:51,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:53,256 INFO L116 PetriNetUnfolderBase]: 2081/4508 cut-off events. [2025-04-29 11:15:53,256 INFO L117 PetriNetUnfolderBase]: For 7919/7919 co-relation queries the response was YES. [2025-04-29 11:15:53,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13010 conditions, 4508 events. 2081/4508 cut-off events. For 7919/7919 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 24718 event pairs, 0 based on Foata normal form. 396/4904 useless extension candidates. Maximal degree in co-relation 12972. Up to 463 conditions per place. [2025-04-29 11:15:53,278 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 406 selfloop transitions, 23 changer transitions 44/476 dead transitions. [2025-04-29 11:15:53,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 476 transitions, 3292 flow [2025-04-29 11:15:53,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:15:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-29 11:15:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 517 transitions. [2025-04-29 11:15:53,280 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-04-29 11:15:53,280 INFO L175 Difference]: Start difference. First operand has 88 places, 53 transitions, 304 flow. Second operand 24 states and 517 transitions. [2025-04-29 11:15:53,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 476 transitions, 3292 flow [2025-04-29 11:15:53,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 476 transitions, 3255 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-04-29 11:15:53,294 INFO L231 Difference]: Finished difference. Result has 109 places, 61 transitions, 386 flow [2025-04-29 11:15:53,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=386, PETRI_PLACES=109, PETRI_TRANSITIONS=61} [2025-04-29 11:15:53,294 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 76 predicate places. [2025-04-29 11:15:53,295 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 61 transitions, 386 flow [2025-04-29 11:15:53,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:53,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:53,295 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-29 11:15:53,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:15:53,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:53,496 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-04-29 11:15:53,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1195535354, now seen corresponding path program 2 times [2025-04-29 11:15:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:53,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588053074] [2025-04-29 11:15:53,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:53,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:53,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:53,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:53,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:53,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588053074] [2025-04-29 11:15:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588053074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:53,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830066216] [2025-04-29 11:15:53,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:53,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:53,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:15:53,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:53,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:53,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:53,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:15:53,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:54,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830066216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:54,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-29 11:15:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025619448] [2025-04-29 11:15:54,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:54,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:54,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:54,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:54,698 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-04-29 11:15:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 61 transitions, 386 flow. Second operand has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:54,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:54,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-04-29 11:15:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:55,693 INFO L116 PetriNetUnfolderBase]: 2333/5064 cut-off events. [2025-04-29 11:15:55,694 INFO L117 PetriNetUnfolderBase]: For 9879/9879 co-relation queries the response was YES. [2025-04-29 11:15:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14949 conditions, 5064 events. 2333/5064 cut-off events. For 9879/9879 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 29218 event pairs, 0 based on Foata normal form. 126/5190 useless extension candidates. Maximal degree in co-relation 14908. Up to 630 conditions per place. [2025-04-29 11:15:55,709 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 0 selfloop transitions, 0 changer transitions 417/417 dead transitions. [2025-04-29 11:15:55,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 417 transitions, 3794 flow [2025-04-29 11:15:55,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:15:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:15:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 297 transitions. [2025-04-29 11:15:55,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-29 11:15:55,711 INFO L175 Difference]: Start difference. First operand has 109 places, 61 transitions, 386 flow. Second operand 15 states and 297 transitions. [2025-04-29 11:15:55,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 417 transitions, 3794 flow [2025-04-29 11:15:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 417 transitions, 3217 flow, removed 169 selfloop flow, removed 18 redundant places. [2025-04-29 11:15:55,727 INFO L231 Difference]: Finished difference. Result has 102 places, 0 transitions, 0 flow [2025-04-29 11:15:55,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=102, PETRI_TRANSITIONS=0} [2025-04-29 11:15:55,728 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2025-04-29 11:15:55,728 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 0 transitions, 0 flow [2025-04-29 11:15:55,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-04-29 11:15:55,730 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-04-29 11:15:55,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:15:55,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:55,931 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:15:55,934 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:15:55,934 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:15:55,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:15:55 BasicIcfg [2025-04-29 11:15:55,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:15:55,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:15:55,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:15:55,938 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:15:55,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:45" (3/4) ... [2025-04-29 11:15:55,940 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:15:55,942 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:15:55,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-04-29 11:15:55,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-04-29 11:15:55,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:15:55,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:15:55,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:15:55,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:15:55,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:15:55,996 INFO L158 Benchmark]: Toolchain (without parser) took 11188.62ms. Allocated memory was 201.3MB in the beginning and 343.9MB in the end (delta: 142.6MB). Free memory was 159.4MB in the beginning and 76.8MB in the end (delta: 82.6MB). Peak memory consumption was 220.6MB. Max. memory is 16.1GB. [2025-04-29 11:15:55,997 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:55,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.24ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 145.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:15:55,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.45ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:15:55,999 INFO L158 Benchmark]: Boogie Preprocessor took 30.60ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:55,999 INFO L158 Benchmark]: RCFGBuilder took 378.26ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 109.2MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-29 11:15:55,999 INFO L158 Benchmark]: TraceAbstraction took 10469.20ms. Allocated memory was 201.3MB in the beginning and 343.9MB in the end (delta: 142.6MB). Free memory was 108.7MB in the beginning and 84.1MB in the end (delta: 24.6MB). Peak memory consumption was 187.1MB. Max. memory is 16.1GB. [2025-04-29 11:15:56,000 INFO L158 Benchmark]: Witness Printer took 57.74ms. Allocated memory is still 343.9MB. Free memory was 84.1MB in the beginning and 76.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:15:56,001 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.48ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.24ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 145.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.45ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.60ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 378.26ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 109.2MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10469.20ms. Allocated memory was 201.3MB in the beginning and 343.9MB in the end (delta: 142.6MB). Free memory was 108.7MB in the beginning and 84.1MB in the end (delta: 24.6MB). Peak memory consumption was 187.1MB. Max. memory is 16.1GB. * Witness Printer took 57.74ms. Allocated memory is still 343.9MB. Free memory was 84.1MB in the beginning and 76.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 45 locations, 47 edges, 14 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: 10.4s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2042 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1955 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4777 IncrementalHoareTripleChecker+Invalid, 4816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 26 mSDtfsCounter, 4777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=12, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 423 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 6885 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1383 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 911/1208 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:15:56,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE