./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.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_05-funloop_hard2.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 d2f3ffb11bb6a1c97782bfc90f78c45a4cc868a08116bba4c906711601e905bd --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:42,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:42,091 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,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:42,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:42,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:42,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:42,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:42,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:42,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:42,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:42,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:42,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:42,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:42,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:42,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:42,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:42,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:42,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:42,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:42,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:42,130 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 -> d2f3ffb11bb6a1c97782bfc90f78c45a4cc868a08116bba4c906711601e905bd [2025-04-29 11:15:42,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:42,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:42,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:42,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:42,374 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:42,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.c [2025-04-29 11:15:43,692 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e86978/a851bcd372d040129e632f963e91b77c/FLAG778ecaff8 [2025-04-29 11:15:43,891 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:43,892 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.c [2025-04-29 11:15:43,893 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,893 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,897 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e86978/a851bcd372d040129e632f963e91b77c/FLAG778ecaff8 [2025-04-29 11:15:44,892 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e86978/a851bcd372d040129e632f963e91b77c [2025-04-29 11:15:44,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:44,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:44,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:44,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:44,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:44,900 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,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea98338 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,900 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,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:45,071 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:45,084 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:45,109 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:45,123 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:45,124 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,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:45,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:45,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:45,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:45,130 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,138 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,162 INFO L138 Inliner]: procedures = 12, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-04-29 11:15:45,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:45,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:45,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:45,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:45,169 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,170 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,172 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,187 INFO L175 MemorySlicer]: Split 26 memory accesses to 1 slices as follows [26]. 100 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [20]. The 3 writes are split as follows [3]. [2025-04-29 11:15:45,190 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,190 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,193 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,194 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,196 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,197 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,197 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,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:45,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:45,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:45,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:45,202 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,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:45,226 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,232 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,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:45,247 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,324 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:45,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:45,508 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:45,508 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:45,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:45,654 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:45,654 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,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:45,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:45,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:45,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:45,659 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,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b771f 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,661 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,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b771f 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,661 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,662 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.c [2025-04-29 11:15:45,673 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:45,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_05-funloop_hard2.c that has 2 procedures, 41 locations, 42 edges, 1 initial locations, 3 loop locations, and 13 error locations. [2025-04-29 11:15:45,675 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:45,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:45,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 90 flow [2025-04-29 11:15:45,774 INFO L116 PetriNetUnfolderBase]: 3/42 cut-off events. [2025-04-29 11:15:45,777 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 42 events. 3/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-29 11:15:45,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 90 flow [2025-04-29 11:15:45,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 42 transitions, 87 flow [2025-04-29 11:15:45,791 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:45,801 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;@6638e603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:45,801 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-04-29 11:15:45,806 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:45,806 INFO L116 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-04-29 11:15:45,806 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:45,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:45,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:45,807 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:45,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1631202347, now seen corresponding path program 1 times [2025-04-29 11:15:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:45,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178739578] [2025-04-29 11:15:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:15:45,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:15:45,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:45,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,006 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:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:46,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178739578] [2025-04-29 11:15:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178739578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:46,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379777375] [2025-04-29 11:15:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:46,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:46,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:46,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:46,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-04-29 11:15:46,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:46,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-04-29 11:15:46,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:46,165 INFO L116 PetriNetUnfolderBase]: 106/288 cut-off events. [2025-04-29 11:15:46,167 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:46,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 288 events. 106/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1436 event pairs, 84 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 491. Up to 213 conditions per place. [2025-04-29 11:15:46,172 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-04-29 11:15:46,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 141 flow [2025-04-29 11:15:46,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-04-29 11:15:46,184 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-04-29 11:15:46,187 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 87 flow. Second operand 3 states and 81 transitions. [2025-04-29 11:15:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 141 flow [2025-04-29 11:15:46,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:46,193 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 98 flow [2025-04-29 11:15:46,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-04-29 11:15:46,197 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-04-29 11:15:46,199 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 98 flow [2025-04-29 11:15:46,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:46,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:46,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:46,199 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:46,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1680514201, now seen corresponding path program 1 times [2025-04-29 11:15:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:46,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079817921] [2025-04-29 11:15:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:46,220 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,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,277 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,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:46,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079817921] [2025-04-29 11:15:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079817921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:46,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793990874] [2025-04-29 11:15:46,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:46,281 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:46,283 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,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:46,338 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,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:15:46,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:46,368 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,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:46,386 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,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793990874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:46,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-29 11:15:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561574943] [2025-04-29 11:15:46,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:46,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:46,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:46,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:46,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-04-29 11:15:46,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:46,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-04-29 11:15:46,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:46,478 INFO L116 PetriNetUnfolderBase]: 106/291 cut-off events. [2025-04-29 11:15:46,480 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:46,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 291 events. 106/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1444 event pairs, 84 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 510. Up to 213 conditions per place. [2025-04-29 11:15:46,483 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-04-29 11:15:46,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 168 flow [2025-04-29 11:15:46,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:15:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-04-29 11:15:46,486 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2025-04-29 11:15:46,486 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 6 states and 140 transitions. [2025-04-29 11:15:46,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 168 flow [2025-04-29 11:15:46,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:46,488 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 130 flow [2025-04-29 11:15:46,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-04-29 11:15:46,489 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-04-29 11:15:46,490 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 130 flow [2025-04-29 11:15:46,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:46,491 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:46,497 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,691 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,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:46,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1721178172, now seen corresponding path program 2 times [2025-04-29 11:15:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:46,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883464926] [2025-04-29 11:15:46,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:46,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-29 11:15:46,711 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,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:46,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:46,791 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:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:46,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883464926] [2025-04-29 11:15:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883464926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:46,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511191634] [2025-04-29 11:15:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:46,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:46,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:46,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:46,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-29 11:15:46,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:46,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-29 11:15:46,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:46,929 INFO L116 PetriNetUnfolderBase]: 106/281 cut-off events. [2025-04-29 11:15:46,930 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:46,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 281 events. 106/281 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1356 event pairs, 24 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 491. Up to 130 conditions per place. [2025-04-29 11:15:46,933 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-04-29 11:15:46,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 232 flow [2025-04-29 11:15:46,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-29 11:15:46,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-04-29 11:15:46,935 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 130 flow. Second operand 4 states and 100 transitions. [2025-04-29 11:15:46,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 232 flow [2025-04-29 11:15:46,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 218 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:46,936 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 114 flow [2025-04-29 11:15:46,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-04-29 11:15:46,937 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-04-29 11:15:46,937 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 114 flow [2025-04-29 11:15:46,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:46,937 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:46,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:46,937 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:46,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1721178173, now seen corresponding path program 1 times [2025-04-29 11:15:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:46,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162453121] [2025-04-29 11:15:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:46,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:46,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:46,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,044 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,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162453121] [2025-04-29 11:15:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162453121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:47,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623322006] [2025-04-29 11:15:47,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:47,046 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:47,047 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:47,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:47,101 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,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:15:47,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:47,119 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,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:47,166 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,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623322006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:47,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:47,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-29 11:15:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935964447] [2025-04-29 11:15:47,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:15:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:15:47,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:15:47,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-04-29 11:15:47,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 114 flow. Second operand has 13 states, 13 states have (on average 19.384615384615383) internal successors, (252), 13 states have internal predecessors, (252), 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,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-04-29 11:15:47,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,261 INFO L116 PetriNetUnfolderBase]: 106/283 cut-off events. [2025-04-29 11:15:47,262 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-29 11:15:47,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 283 events. 106/283 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1270 event pairs, 84 based on Foata normal form. 6/272 useless extension candidates. Maximal degree in co-relation 513. Up to 213 conditions per place. [2025-04-29 11:15:47,263 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2025-04-29 11:15:47,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 220 flow [2025-04-29 11:15:47,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2025-04-29 11:15:47,265 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49806201550387597 [2025-04-29 11:15:47,266 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 114 flow. Second operand 12 states and 257 transitions. [2025-04-29 11:15:47,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 220 flow [2025-04-29 11:15:47,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:47,268 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 192 flow [2025-04-29 11:15:47,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-04-29 11:15:47,269 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-04-29 11:15:47,269 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 192 flow [2025-04-29 11:15:47,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.384615384615383) internal successors, (252), 13 states have internal predecessors, (252), 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,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,270 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:15:47,474 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,SelfDestructingSolverStorable3 [2025-04-29 11:15:47,474 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:47,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1130023709, now seen corresponding path program 2 times [2025-04-29 11:15:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380091870] [2025-04-29 11:15:47,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:15:47,489 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:47,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:47,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,609 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:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380091870] [2025-04-29 11:15:47,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380091870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:47,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:47,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003214866] [2025-04-29 11:15:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:47,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:47,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-29 11:15:47,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-29 11:15:47,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,766 INFO L116 PetriNetUnfolderBase]: 210/473 cut-off events. [2025-04-29 11:15:47,766 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-29 11:15:47,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 473 events. 210/473 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2063 event pairs, 103 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 891. Up to 274 conditions per place. [2025-04-29 11:15:47,768 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 65 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-04-29 11:15:47,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 390 flow [2025-04-29 11:15:47,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-04-29 11:15:47,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.641860465116279 [2025-04-29 11:15:47,769 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 192 flow. Second operand 5 states and 138 transitions. [2025-04-29 11:15:47,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 390 flow [2025-04-29 11:15:47,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 342 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-29 11:15:47,772 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 166 flow [2025-04-29 11:15:47,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-04-29 11:15:47,772 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-04-29 11:15:47,773 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 166 flow [2025-04-29 11:15:47,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:47,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,773 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:47,773 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:47,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1093719216, now seen corresponding path program 1 times [2025-04-29 11:15:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853787628] [2025-04-29 11:15:47,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:15:47,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:15:47,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:47,857 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:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:47,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853787628] [2025-04-29 11:15:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853787628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127406897] [2025-04-29 11:15:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:47,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:47,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:47,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:47,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-29 11:15:47,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:47,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-29 11:15:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:47,981 INFO L116 PetriNetUnfolderBase]: 184/457 cut-off events. [2025-04-29 11:15:47,981 INFO L117 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-04-29 11:15:47,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 457 events. 184/457 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2178 event pairs, 91 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 943. Up to 238 conditions per place. [2025-04-29 11:15:47,983 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-29 11:15:47,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 292 flow [2025-04-29 11:15:47,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-29 11:15:47,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2025-04-29 11:15:47,985 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 166 flow. Second operand 4 states and 91 transitions. [2025-04-29 11:15:47,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 292 flow [2025-04-29 11:15:47,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:47,989 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 164 flow [2025-04-29 11:15:47,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-04-29 11:15:47,990 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-04-29 11:15:47,990 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 164 flow [2025-04-29 11:15:47,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:47,991 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:47,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:15:47,991 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:47,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1093719217, now seen corresponding path program 1 times [2025-04-29 11:15:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:47,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286829240] [2025-04-29 11:15:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:47,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:15:48,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:15:48,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:48,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,158 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,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:48,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286829240] [2025-04-29 11:15:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286829240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591756947] [2025-04-29 11:15:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:48,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:48,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:48,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:48,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-04-29 11:15:48,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:48,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-04-29 11:15:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:48,357 INFO L116 PetriNetUnfolderBase]: 310/694 cut-off events. [2025-04-29 11:15:48,357 INFO L117 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-04-29 11:15:48,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 694 events. 310/694 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3191 event pairs, 172 based on Foata normal form. 14/658 useless extension candidates. Maximal degree in co-relation 1526. Up to 462 conditions per place. [2025-04-29 11:15:48,363 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 62 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-04-29 11:15:48,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 380 flow [2025-04-29 11:15:48,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-04-29 11:15:48,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2025-04-29 11:15:48,366 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 164 flow. Second operand 5 states and 118 transitions. [2025-04-29 11:15:48,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 380 flow [2025-04-29 11:15:48,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:48,370 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 184 flow [2025-04-29 11:15:48,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2025-04-29 11:15:48,370 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-04-29 11:15:48,370 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 184 flow [2025-04-29 11:15:48,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:48,372 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:48,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:15:48,372 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:48,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1447697281, now seen corresponding path program 1 times [2025-04-29 11:15:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:48,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172328361] [2025-04-29 11:15:48,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:48,383 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,536 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,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:48,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172328361] [2025-04-29 11:15:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172328361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:48,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791757680] [2025-04-29 11:15:48,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:48,538 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:48,540 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:48,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:48,596 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,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:48,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:15:48,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:48,789 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,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:48,931 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,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791757680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:48,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-29 11:15:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399354029] [2025-04-29 11:15:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:48,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:15:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:48,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:15:48,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:15:49,108 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-29 11:15:49,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 184 flow. Second operand has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 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,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:49,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-29 11:15:49,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:49,658 INFO L116 PetriNetUnfolderBase]: 629/1380 cut-off events. [2025-04-29 11:15:49,658 INFO L117 PetriNetUnfolderBase]: For 478/507 co-relation queries the response was YES. [2025-04-29 11:15:49,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3196 conditions, 1380 events. 629/1380 cut-off events. For 478/507 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6725 event pairs, 72 based on Foata normal form. 133/1494 useless extension candidates. Maximal degree in co-relation 3140. Up to 242 conditions per place. [2025-04-29 11:15:49,665 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 185 selfloop transitions, 12 changer transitions 0/204 dead transitions. [2025-04-29 11:15:49,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 204 transitions, 1026 flow [2025-04-29 11:15:49,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 345 transitions. [2025-04-29 11:15:49,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2025-04-29 11:15:49,667 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 184 flow. Second operand 12 states and 345 transitions. [2025-04-29 11:15:49,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 204 transitions, 1026 flow [2025-04-29 11:15:49,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 204 transitions, 1004 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:49,670 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 259 flow [2025-04-29 11:15:49,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=259, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2025-04-29 11:15:49,671 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-04-29 11:15:49,671 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 259 flow [2025-04-29 11:15:49,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 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,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:49,672 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:49,678 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:49,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:49,872 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:49,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1936307076, now seen corresponding path program 1 times [2025-04-29 11:15:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:49,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492486975] [2025-04-29 11:15:49,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:49,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:49,886 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,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:50,012 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,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:50,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492486975] [2025-04-29 11:15:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492486975] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:50,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557588989] [2025-04-29 11:15:50,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:50,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:50,016 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:50,017 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:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:15:50,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:15:50,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:50,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:50,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:15:50,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:50,235 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,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:50,345 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,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557588989] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:50,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-29 11:15:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309939773] [2025-04-29 11:15:50,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:50,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:15:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:50,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:15:50,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:15:50,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-04-29 11:15:50,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 259 flow. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 14 states have internal predecessors, (224), 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,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:50,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-04-29 11:15:50,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:51,059 INFO L116 PetriNetUnfolderBase]: 1250/2746 cut-off events. [2025-04-29 11:15:51,059 INFO L117 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2025-04-29 11:15:51,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 2746 events. 1250/2746 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 14977 event pairs, 306 based on Foata normal form. 224/2938 useless extension candidates. Maximal degree in co-relation 7260. Up to 782 conditions per place. [2025-04-29 11:15:51,071 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 211 selfloop transitions, 12 changer transitions 0/228 dead transitions. [2025-04-29 11:15:51,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 228 transitions, 1729 flow [2025-04-29 11:15:51,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2025-04-29 11:15:51,073 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.560077519379845 [2025-04-29 11:15:51,073 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 259 flow. Second operand 12 states and 289 transitions. [2025-04-29 11:15:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 228 transitions, 1729 flow [2025-04-29 11:15:51,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 228 transitions, 1548 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:51,080 INFO L231 Difference]: Finished difference. Result has 94 places, 60 transitions, 319 flow [2025-04-29 11:15:51,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=319, PETRI_PLACES=94, PETRI_TRANSITIONS=60} [2025-04-29 11:15:51,081 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2025-04-29 11:15:51,081 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 60 transitions, 319 flow [2025-04-29 11:15:51,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 14 states have internal predecessors, (224), 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,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:51,082 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-29 11:15:51,089 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:51,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:51,286 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:51,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -168175971, now seen corresponding path program 2 times [2025-04-29 11:15:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:51,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856908838] [2025-04-29 11:15:51,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:51,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:51,316 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,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:51,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:51,579 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,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:51,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856908838] [2025-04-29 11:15:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856908838] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:51,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116817750] [2025-04-29 11:15:51,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:51,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:51,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:51,582 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:51,584 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:51,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:51,659 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,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:51,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:15:51,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:51,945 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,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:52,181 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:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116817750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:52,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-29 11:15:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472877065] [2025-04-29 11:15:52,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:52,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:52,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-29 11:15:52,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 60 transitions, 319 flow. Second operand has 23 states, 23 states have (on average 18.17391304347826) internal successors, (418), 23 states have internal predecessors, (418), 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:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-29 11:15:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:54,122 INFO L116 PetriNetUnfolderBase]: 2333/5055 cut-off events. [2025-04-29 11:15:54,123 INFO L117 PetriNetUnfolderBase]: For 8735/8796 co-relation queries the response was YES. [2025-04-29 11:15:54,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14212 conditions, 5055 events. 2333/5055 cut-off events. For 8735/8796 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 28875 event pairs, 0 based on Foata normal form. 444/5499 useless extension candidates. Maximal degree in co-relation 14141. Up to 519 conditions per place. [2025-04-29 11:15:54,151 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 516 selfloop transitions, 23 changer transitions 22/567 dead transitions. [2025-04-29 11:15:54,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 567 transitions, 3893 flow [2025-04-29 11:15:54,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:15:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-29 11:15:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 701 transitions. [2025-04-29 11:15:54,154 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6792635658914729 [2025-04-29 11:15:54,154 INFO L175 Difference]: Start difference. First operand has 94 places, 60 transitions, 319 flow. Second operand 24 states and 701 transitions. [2025-04-29 11:15:54,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 567 transitions, 3893 flow [2025-04-29 11:15:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 567 transitions, 3488 flow, removed 154 selfloop flow, removed 7 redundant places. [2025-04-29 11:15:54,170 INFO L231 Difference]: Finished difference. Result has 115 places, 69 transitions, 411 flow [2025-04-29 11:15:54,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=411, PETRI_PLACES=115, PETRI_TRANSITIONS=69} [2025-04-29 11:15:54,172 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2025-04-29 11:15:54,173 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 69 transitions, 411 flow [2025-04-29 11:15:54,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 18.17391304347826) internal successors, (418), 23 states have internal predecessors, (418), 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,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:54,173 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-29 11:15:54,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:54,377 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,SelfDestructingSolverStorable9 [2025-04-29 11:15:54,377 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:54,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash -494409743, now seen corresponding path program 2 times [2025-04-29 11:15:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:54,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899927950] [2025-04-29 11:15:54,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:54,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:54,402 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:54,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:54,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:54,637 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:54,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:54,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899927950] [2025-04-29 11:15:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899927950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:54,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272634367] [2025-04-29 11:15:54,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:54,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:54,639 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:54,641 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:54,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 11:15:54,726 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:54,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:54,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:15:54,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:55,049 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:55,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:55,505 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:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272634367] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:55,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-29 11:15:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222986535] [2025-04-29 11:15:55,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:55,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:55,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:55,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:55,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-04-29 11:15:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 69 transitions, 411 flow. Second operand has 23 states, 23 states have (on average 17.17391304347826) internal successors, (395), 23 states have internal predecessors, (395), 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,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-04-29 11:15:55,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,847 INFO L116 PetriNetUnfolderBase]: 2711/5946 cut-off events. [2025-04-29 11:15:56,848 INFO L117 PetriNetUnfolderBase]: For 11939/11939 co-relation queries the response was YES. [2025-04-29 11:15:56,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17492 conditions, 5946 events. 2711/5946 cut-off events. For 11939/11939 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 35898 event pairs, 0 based on Foata normal form. 189/6135 useless extension candidates. Maximal degree in co-relation 17418. Up to 945 conditions per place. [2025-04-29 11:15:56,884 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 407 selfloop transitions, 14 changer transitions 0/425 dead transitions. [2025-04-29 11:15:56,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 425 transitions, 3833 flow [2025-04-29 11:15:56,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:15:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:15:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 349 transitions. [2025-04-29 11:15:56,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5410852713178295 [2025-04-29 11:15:56,886 INFO L175 Difference]: Start difference. First operand has 115 places, 69 transitions, 411 flow. Second operand 15 states and 349 transitions. [2025-04-29 11:15:56,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 425 transitions, 3833 flow [2025-04-29 11:15:56,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 425 transitions, 3264 flow, removed 169 selfloop flow, removed 14 redundant places. [2025-04-29 11:15:56,904 INFO L231 Difference]: Finished difference. Result has 114 places, 70 transitions, 391 flow [2025-04-29 11:15:56,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=391, PETRI_PLACES=114, PETRI_TRANSITIONS=70} [2025-04-29 11:15:56,905 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2025-04-29 11:15:56,905 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 70 transitions, 391 flow [2025-04-29 11:15:56,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.17391304347826) internal successors, (395), 23 states have internal predecessors, (395), 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:56,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,906 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:56,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:57,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:57,110 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-04-29 11:15:57,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 293313499, now seen corresponding path program 1 times [2025-04-29 11:15:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209132485] [2025-04-29 11:15:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:15:57,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:15:57,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-04-29 11:15:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209132485] [2025-04-29 11:15:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209132485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254371025] [2025-04-29 11:15:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:57,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:57,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-04-29 11:15:57,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 70 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:57,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-04-29 11:15:57,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,776 INFO L116 PetriNetUnfolderBase]: 2648/5773 cut-off events. [2025-04-29 11:15:57,777 INFO L117 PetriNetUnfolderBase]: For 8837/8867 co-relation queries the response was YES. [2025-04-29 11:15:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16758 conditions, 5773 events. 2648/5773 cut-off events. For 8837/8867 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 34713 event pairs, 2542 based on Foata normal form. 63/5833 useless extension candidates. Maximal degree in co-relation 16687. Up to 5306 conditions per place. [2025-04-29 11:15:57,797 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2025-04-29 11:15:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 69 transitions, 519 flow [2025-04-29 11:15:57,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-04-29 11:15:57,798 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2025-04-29 11:15:57,798 INFO L175 Difference]: Start difference. First operand has 114 places, 70 transitions, 391 flow. Second operand 3 states and 76 transitions. [2025-04-29 11:15:57,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 69 transitions, 519 flow [2025-04-29 11:15:57,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 69 transitions, 494 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-29 11:15:57,816 INFO L231 Difference]: Finished difference. Result has 105 places, 0 transitions, 0 flow [2025-04-29 11:15:57,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=105, PETRI_TRANSITIONS=0} [2025-04-29 11:15:57,817 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2025-04-29 11:15:57,817 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 0 transitions, 0 flow [2025-04-29 11:15:57,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:57,819 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2025-04-29 11:15:57,819 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-04-29 11:15:57,819 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (9 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-04-29 11:15:57,820 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-04-29 11:15:57,821 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-04-29 11:15:57,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:15:57,821 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-04-29 11:15:57,824 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:15:57,825 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:15:57,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:15:57 BasicIcfg [2025-04-29 11:15:57,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:15:57,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:15:57,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:15:57,829 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:15:57,829 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:57,830 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:15:57,832 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:15:57,836 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-04-29 11:15:57,837 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:15:57,837 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:15:57,837 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:15:57,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:15:57,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:15:57,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:15:57,901 INFO L158 Benchmark]: Toolchain (without parser) took 13006.22ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 111.6MB in the beginning and 289.2MB in the end (delta: -177.6MB). Peak memory consumption was 315.5MB. Max. memory is 16.1GB. [2025-04-29 11:15:57,901 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:57,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.44ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 97.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:15:57,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.73ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:57,903 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:57,903 INFO L158 Benchmark]: RCFGBuilder took 453.17ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 58.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-29 11:15:57,903 INFO L158 Benchmark]: TraceAbstraction took 12172.64ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 58.0MB in the beginning and 295.0MB in the end (delta: -237.0MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. [2025-04-29 11:15:57,904 INFO L158 Benchmark]: Witness Printer took 72.28ms. Allocated memory is still 637.5MB. Free memory was 294.6MB in the beginning and 289.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:15:57,905 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.44ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 97.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.73ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 453.17ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 58.8MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12172.64ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 58.0MB in the beginning and 295.0MB in the end (delta: -237.0MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. * Witness Printer took 72.28ms. Allocated memory is still 637.5MB. Free memory was 294.6MB in the beginning and 289.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 28]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 55 locations, 57 edges, 18 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: 12.1s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2651 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2517 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5977 IncrementalHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 24 mSDtfsCounter, 5977 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=10, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 457 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 7097 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 1074/1370 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:15:57,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE