./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.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/09-regions_02-list_nr.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 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:51,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:51,228 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:51,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:51,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:51,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:51,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:51,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:51,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:51,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:51,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:51,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:51,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:51,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:51,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:51,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:51,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:51,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:51,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:51,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:51,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:51,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:51,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:51,249 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 -> 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 [2025-04-29 11:15:51,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:51,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:51,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:51,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:51,476 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:51,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:15:52,742 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee73e2f6/00f655d001154becab22844e4c8d12cb/FLAGef5dabb3b [2025-04-29 11:15:52,977 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:52,981 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:15:52,983 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:52,983 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:52,983 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:52,993 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee73e2f6/00f655d001154becab22844e4c8d12cb/FLAGef5dabb3b [2025-04-29 11:15:53,743 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee73e2f6/00f655d001154becab22844e4c8d12cb [2025-04-29 11:15:53,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:53,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:53,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:53,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:53,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:53,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:53" (1/1) ... [2025-04-29 11:15:53,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644546c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:53, skipping insertion in model container [2025-04-29 11:15:53,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:53" (1/1) ... [2025-04-29 11:15:53,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:53,923 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:53,936 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:53,964 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:53,980 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:53,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:53 WrapperNode [2025-04-29 11:15:53,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:53,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:53,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:53,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:53,988 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:53" (1/1) ... [2025-04-29 11:15:53,995 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:53" (1/1) ... [2025-04-29 11:15:54,009 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2025-04-29 11:15:54,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:54,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:54,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:54,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:54,017 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:53" (1/1) ... [2025-04-29 11:15:54,018 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:53" (1/1) ... [2025-04-29 11:15:54,021 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:53" (1/1) ... [2025-04-29 11:15:54,038 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [1, 12]. 92 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 9 writes are split as follows [0, 9]. [2025-04-29 11:15:54,038 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:53" (1/1) ... [2025-04-29 11:15:54,038 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:53" (1/1) ... [2025-04-29 11:15:54,048 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:53" (1/1) ... [2025-04-29 11:15:54,049 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:53" (1/1) ... [2025-04-29 11:15:54,050 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:53" (1/1) ... [2025-04-29 11:15:54,051 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:53" (1/1) ... [2025-04-29 11:15:54,052 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:53" (1/1) ... [2025-04-29 11:15:54,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:54,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:54,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:54,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:54,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:53" (1/1) ... [2025-04-29 11:15:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:54,091 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:54,093 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:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:54,111 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:54,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:54,112 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:54,113 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:54,196 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:54,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:54,385 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:54,386 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:54,482 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:54,483 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:54,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:54 BoogieIcfgContainer [2025-04-29 11:15:54,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:54,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:54,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:54,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:54,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:53" (1/3) ... [2025-04-29 11:15:54,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1fe5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:54, skipping insertion in model container [2025-04-29 11:15:54,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:53" (2/3) ... [2025-04-29 11:15:54,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1fe5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:54, skipping insertion in model container [2025-04-29 11:15:54,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:54" (3/3) ... [2025-04-29 11:15:54,490 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.c [2025-04-29 11:15:54,499 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:54,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.c that has 2 procedures, 52 locations, 50 edges, 1 initial locations, 0 loop locations, and 25 error locations. [2025-04-29 11:15:54,500 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:54,548 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:54,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-04-29 11:15:54,594 INFO L116 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-04-29 11:15:54,596 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:54,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:15:54,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-04-29 11:15:54,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-04-29 11:15:54,606 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:54,614 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;@1c27b312, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:54,615 INFO L341 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-04-29 11:15:54,617 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:54,618 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-29 11:15:54,618 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:54,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:54,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:15:54,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:54,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash 7198, now seen corresponding path program 1 times [2025-04-29 11:15:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:54,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941003178] [2025-04-29 11:15:54,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:54,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:15:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:15:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:54,797 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:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:54,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941003178] [2025-04-29 11:15:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941003178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:54,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418945416] [2025-04-29 11:15:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:54,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:54,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:54,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-29 11:15:54,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:54,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-29 11:15:54,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:54,985 INFO L116 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-04-29 11:15:54,986 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:54,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 172 events. 42/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 745 event pairs, 42 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 256. Up to 101 conditions per place. [2025-04-29 11:15:54,990 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-29 11:15:54,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-04-29 11:15:54,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-29 11:15:55,001 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-04-29 11:15:55,003 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-04-29 11:15:55,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-04-29 11:15:55,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:55,009 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-04-29 11:15:55,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-29 11:15:55,014 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-29 11:15:55,016 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-04-29 11:15:55,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:55,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:15:55,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:55,016 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:55,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 7199, now seen corresponding path program 1 times [2025-04-29 11:15:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:55,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346890320] [2025-04-29 11:15:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:15:55,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:15:55,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:55,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:55,166 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:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:55,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346890320] [2025-04-29 11:15:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346890320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:15:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719738225] [2025-04-29 11:15:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:55,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:55,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:55,211 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-29 11:15:55,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:55,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-29 11:15:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:55,281 INFO L116 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-04-29 11:15:55,281 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:15:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 168 events. 42/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 736 event pairs, 42 based on Foata normal form. 3/138 useless extension candidates. Maximal degree in co-relation 264. Up to 101 conditions per place. [2025-04-29 11:15:55,283 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-29 11:15:55,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-04-29 11:15:55,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-29 11:15:55,285 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-29 11:15:55,285 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-04-29 11:15:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-04-29 11:15:55,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:55,287 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-04-29 11:15:55,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-29 11:15:55,289 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-04-29 11:15:55,289 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-04-29 11:15:55,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:55,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:15:55,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:15:55,290 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:55,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1936686558, now seen corresponding path program 1 times [2025-04-29 11:15:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:55,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83939291] [2025-04-29 11:15:55,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:55,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:15:55,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:15:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:55,392 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:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:55,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83939291] [2025-04-29 11:15:55,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83939291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:55,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003028501] [2025-04-29 11:15:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:55,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:55,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:55,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:55,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-04-29 11:15:55,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:55,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-04-29 11:15:55,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:55,549 INFO L116 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-04-29 11:15:55,549 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 174 events. 49/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 728 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 285. Up to 115 conditions per place. [2025-04-29 11:15:55,550 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 19 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-04-29 11:15:55,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 124 flow [2025-04-29 11:15:55,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-29 11:15:55,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-04-29 11:15:55,552 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-04-29 11:15:55,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 124 flow [2025-04-29 11:15:55,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:55,553 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 82 flow [2025-04-29 11:15:55,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-04-29 11:15:55,553 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-04-29 11:15:55,553 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 82 flow [2025-04-29 11:15:55,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:55,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:15:55,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:55,554 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:55,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1936686557, now seen corresponding path program 1 times [2025-04-29 11:15:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:55,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368582768] [2025-04-29 11:15:55,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:15:55,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:15:55,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:55,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:55,665 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:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:55,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368582768] [2025-04-29 11:15:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368582768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772554000] [2025-04-29 11:15:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:55,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:55,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:55,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:55,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-29 11:15:55,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:55,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-29 11:15:55,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:55,731 INFO L116 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-04-29 11:15:55,731 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:55,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 144 events. 42/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 545 event pairs, 42 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 240. Up to 101 conditions per place. [2025-04-29 11:15:55,732 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-04-29 11:15:55,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 110 flow [2025-04-29 11:15:55,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-29 11:15:55,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-29 11:15:55,733 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 3 states and 109 transitions. [2025-04-29 11:15:55,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 110 flow [2025-04-29 11:15:55,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:55,733 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-04-29 11:15:55,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-04-29 11:15:55,735 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-04-29 11:15:55,735 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-04-29 11:15:55,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:55,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:55,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:15:55,735 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:55,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1533251076, now seen corresponding path program 1 times [2025-04-29 11:15:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:55,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606568768] [2025-04-29 11:15:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:55,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:55,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:55,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:55,806 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:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:55,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606568768] [2025-04-29 11:15:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606568768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513850020] [2025-04-29 11:15:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:55,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:55,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:55,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:55,837 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-04-29 11:15:55,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:55,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-04-29 11:15:55,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:55,894 INFO L116 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-04-29 11:15:55,894 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:15:55,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 166 events. 49/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 683 event pairs, 35 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 281. Up to 88 conditions per place. [2025-04-29 11:15:55,895 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-04-29 11:15:55,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-04-29 11:15:55,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-04-29 11:15:55,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-04-29 11:15:55,897 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-04-29 11:15:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-04-29 11:15:55,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:55,898 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-04-29 11:15:55,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-04-29 11:15:55,899 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-04-29 11:15:55,899 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-04-29 11:15:55,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:55,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:55,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:55,899 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:55,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1533251075, now seen corresponding path program 1 times [2025-04-29 11:15:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:55,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297764586] [2025-04-29 11:15:55,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:55,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:55,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:56,035 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:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:56,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297764586] [2025-04-29 11:15:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297764586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011064792] [2025-04-29 11:15:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:56,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:56,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:56,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:56,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-04-29 11:15:56,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:56,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-04-29 11:15:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,126 INFO L116 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-04-29 11:15:56,127 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:15:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 143 events. 42/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 543 event pairs, 35 based on Foata normal form. 16/147 useless extension candidates. Maximal degree in co-relation 259. Up to 88 conditions per place. [2025-04-29 11:15:56,128 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-29 11:15:56,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-04-29 11:15:56,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-29 11:15:56,129 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-04-29 11:15:56,129 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-04-29 11:15:56,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-04-29 11:15:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:56,130 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-04-29 11:15:56,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-04-29 11:15:56,131 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-04-29 11:15:56,131 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-04-29 11:15:56,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:56,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:15:56,131 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:56,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -142189103, now seen corresponding path program 1 times [2025-04-29 11:15:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190128281] [2025-04-29 11:15:56,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:56,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:56,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:56,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:56,313 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:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:56,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190128281] [2025-04-29 11:15:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190128281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:56,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:56,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:15:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56312501] [2025-04-29 11:15:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:56,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:56,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:56,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:56,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-04-29 11:15:56,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:56,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-04-29 11:15:56,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,542 INFO L116 PetriNetUnfolderBase]: 77/214 cut-off events. [2025-04-29 11:15:56,542 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-29 11:15:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 214 events. 77/214 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 851 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 408. Up to 107 conditions per place. [2025-04-29 11:15:56,543 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 32 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-04-29 11:15:56,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 188 flow [2025-04-29 11:15:56,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:15:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-29 11:15:56,545 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2025-04-29 11:15:56,546 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 181 transitions. [2025-04-29 11:15:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 188 flow [2025-04-29 11:15:56,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:56,549 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 112 flow [2025-04-29 11:15:56,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-04-29 11:15:56,549 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-04-29 11:15:56,550 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 112 flow [2025-04-29 11:15:56,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:56,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:15:56,550 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:56,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -142189102, now seen corresponding path program 1 times [2025-04-29 11:15:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196192796] [2025-04-29 11:15:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:15:56,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:15:56,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:56,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:56,773 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:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:56,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196192796] [2025-04-29 11:15:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196192796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762794499] [2025-04-29 11:15:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:56,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:15:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:56,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:15:56,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:15:56,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-29 11:15:56,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:56,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-29 11:15:56,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:56,969 INFO L116 PetriNetUnfolderBase]: 98/265 cut-off events. [2025-04-29 11:15:56,969 INFO L117 PetriNetUnfolderBase]: For 85/87 co-relation queries the response was YES. [2025-04-29 11:15:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 265 events. 98/265 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1157 event pairs, 6 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 599. Up to 101 conditions per place. [2025-04-29 11:15:56,971 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-04-29 11:15:56,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 238 flow [2025-04-29 11:15:56,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-04-29 11:15:56,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7098039215686275 [2025-04-29 11:15:56,974 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 112 flow. Second operand 5 states and 181 transitions. [2025-04-29 11:15:56,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 238 flow [2025-04-29 11:15:56,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:56,976 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 144 flow [2025-04-29 11:15:56,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-04-29 11:15:56,978 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-04-29 11:15:56,978 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 144 flow [2025-04-29 11:15:56,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:56,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:56,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:15:56,979 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:56,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 613233648, now seen corresponding path program 1 times [2025-04-29 11:15:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:56,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852409496] [2025-04-29 11:15:56,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:56,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:15:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:15:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,265 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:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852409496] [2025-04-29 11:15:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852409496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:15:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342691651] [2025-04-29 11:15:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:15:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:15:57,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:15:57,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-29 11:15:57,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 144 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-29 11:15:57,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,599 INFO L116 PetriNetUnfolderBase]: 106/293 cut-off events. [2025-04-29 11:15:57,599 INFO L117 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-04-29 11:15:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 293 events. 106/293 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1320 event pairs, 19 based on Foata normal form. 8/290 useless extension candidates. Maximal degree in co-relation 730. Up to 77 conditions per place. [2025-04-29 11:15:57,602 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2025-04-29 11:15:57,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 412 flow [2025-04-29 11:15:57,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:15:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:15:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-04-29 11:15:57,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-04-29 11:15:57,603 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 144 flow. Second operand 9 states and 210 transitions. [2025-04-29 11:15:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 412 flow [2025-04-29 11:15:57,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 397 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:15:57,607 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 278 flow [2025-04-29 11:15:57,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-04-29 11:15:57,607 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-04-29 11:15:57,607 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 278 flow [2025-04-29 11:15:57,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:57,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:15:57,609 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:57,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash 839635857, now seen corresponding path program 1 times [2025-04-29 11:15:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312609849] [2025-04-29 11:15:57,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:15:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:15:57,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,956 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:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312609849] [2025-04-29 11:15:57,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312609849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:15:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115316552] [2025-04-29 11:15:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:15:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:15:57,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:15:58,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-29 11:15:58,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 278 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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:58,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-29 11:15:58,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,326 INFO L116 PetriNetUnfolderBase]: 106/292 cut-off events. [2025-04-29 11:15:58,326 INFO L117 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-04-29 11:15:58,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 292 events. 106/292 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1305 event pairs, 19 based on Foata normal form. 8/289 useless extension candidates. Maximal degree in co-relation 851. Up to 77 conditions per place. [2025-04-29 11:15:58,328 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 42 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2025-04-29 11:15:58,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 468 flow [2025-04-29 11:15:58,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:15:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:15:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-04-29 11:15:58,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-29 11:15:58,329 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 278 flow. Second operand 9 states and 207 transitions. [2025-04-29 11:15:58,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 468 flow [2025-04-29 11:15:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 67 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,332 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 338 flow [2025-04-29 11:15:58,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-04-29 11:15:58,332 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-04-29 11:15:58,332 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 338 flow [2025-04-29 11:15:58,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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:58,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:15:58,332 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:58,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -486715613, now seen corresponding path program 1 times [2025-04-29 11:15:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878835043] [2025-04-29 11:15:58,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:15:58,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:15:58,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,403 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:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878835043] [2025-04-29 11:15:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878835043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063068336] [2025-04-29 11:15:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:58,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:58,446 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-04-29 11:15:58,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:58,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-04-29 11:15:58,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,504 INFO L116 PetriNetUnfolderBase]: 95/266 cut-off events. [2025-04-29 11:15:58,504 INFO L117 PetriNetUnfolderBase]: For 759/759 co-relation queries the response was YES. [2025-04-29 11:15:58,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 266 events. 95/266 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1168 event pairs, 20 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 903. Up to 169 conditions per place. [2025-04-29 11:15:58,506 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 44 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-04-29 11:15:58,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 478 flow [2025-04-29 11:15:58,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-04-29 11:15:58,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7205882352941176 [2025-04-29 11:15:58,507 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 338 flow. Second operand 4 states and 147 transitions. [2025-04-29 11:15:58,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 478 flow [2025-04-29 11:15:58,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 440 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-29 11:15:58,509 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 306 flow [2025-04-29 11:15:58,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-04-29 11:15:58,510 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2025-04-29 11:15:58,510 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 306 flow [2025-04-29 11:15:58,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:58,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:15:58,511 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:58,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash -486715612, now seen corresponding path program 1 times [2025-04-29 11:15:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799057305] [2025-04-29 11:15:58,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:15:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:15:58,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,583 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:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799057305] [2025-04-29 11:15:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799057305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428450808] [2025-04-29 11:15:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:58,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:58,608 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 51 [2025-04-29 11:15:58,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:58,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 51 [2025-04-29 11:15:58,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,654 INFO L116 PetriNetUnfolderBase]: 75/219 cut-off events. [2025-04-29 11:15:58,655 INFO L117 PetriNetUnfolderBase]: For 533/533 co-relation queries the response was YES. [2025-04-29 11:15:58,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 219 events. 75/219 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 932 event pairs, 30 based on Foata normal form. 15/232 useless extension candidates. Maximal degree in co-relation 726. Up to 159 conditions per place. [2025-04-29 11:15:58,657 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 26 selfloop transitions, 1 changer transitions 13/50 dead transitions. [2025-04-29 11:15:58,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 396 flow [2025-04-29 11:15:58,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-04-29 11:15:58,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2025-04-29 11:15:58,658 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 306 flow. Second operand 3 states and 122 transitions. [2025-04-29 11:15:58,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 396 flow [2025-04-29 11:15:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:58,660 INFO L231 Difference]: Finished difference. Result has 60 places, 31 transitions, 176 flow [2025-04-29 11:15:58,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=31} [2025-04-29 11:15:58,662 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-04-29 11:15:58,663 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 31 transitions, 176 flow [2025-04-29 11:15:58,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:58,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:15:58,663 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:15:58,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1117526673, now seen corresponding path program 1 times [2025-04-29 11:15:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981271993] [2025-04-29 11:15:58,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:15:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:15:58,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:15:58,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:15:58,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:15:58,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:15:58,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:15:58,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:15:58,699 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:15:58,699 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-04-29 11:15:58,700 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-04-29 11:15:58,701 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-04-29 11:15:58,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:15:58,702 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,727 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:15:58,727 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:15:58,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:15:58 BasicIcfg [2025-04-29 11:15:58,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:15:58,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:15:58,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:15:58,733 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:15:58,734 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:54" (3/4) ... [2025-04-29 11:15:58,735 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:15:58,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:15:58,736 INFO L158 Benchmark]: Toolchain (without parser) took 4989.90ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 110.5MB in the beginning and 182.3MB in the end (delta: -71.8MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2025-04-29 11:15:58,736 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 125.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:58,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 97.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:15:58,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.56ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:58,737 INFO L158 Benchmark]: Boogie Preprocessor took 43.65ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:58,737 INFO L158 Benchmark]: RCFGBuilder took 424.27ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 63.8MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-29 11:15:58,738 INFO L158 Benchmark]: TraceAbstraction took 4248.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 63.8MB in the beginning and 182.4MB in the end (delta: -118.6MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-04-29 11:15:58,738 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 302.0MB. Free memory was 182.4MB in the beginning and 182.3MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:15:58,739 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.14ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 125.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 97.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.56ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.65ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 424.27ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 63.8MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4248.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 63.8MB in the beginning and 182.4MB in the end (delta: -118.6MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 302.0MB. Free memory was 182.4MB in the beginning and 182.3MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 38]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 38. Possible FailurePath: [L12-L15] 0 struct s { int datum; struct s *next; } *A; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L23] 0 pthread_mutex_t B_mutex = PTHREAD_MUTEX_INITIALIZER; [L39] 0 pthread_t t1; [L40] 0 struct s *p = malloc(sizeof(struct s)); [L41] CALL 0 init(p,9) [L18] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B_mutex=0] [L19] 0 p -> next = NULL [L41] RET 0 init(p,9) [L43] 0 A = malloc(sizeof(struct s)) [L44] CALL 0 init(A,3) [L18] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B_mutex=0] [L19] 0 p -> next = NULL [L44] RET 0 init(A,3) [L45] 0 A->next = p [L47] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [A={-3:0}, A_mutex={1:0}, B_mutex=0, p={-2:0}, t1=-1] [L50] EXPR 0 A->next [L50] 0 p = A->next [L51] 0 p->datum [L53] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B_mutex=0, \result=0, p={-2:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 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: 4.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1334 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2150 IncrementalHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 86 mSDtfsCounter, 2150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:15:58,759 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/09-regions_02-list_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:00,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:00,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:16:00,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:00,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:00,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:00,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:00,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:00,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:00,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:00,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:00,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:00,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:00,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:00,777 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:00,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:00,778 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:00,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:00,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:00,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:16:00,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:00,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:00,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:00,780 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 -> 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 [2025-04-29 11:16:01,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:01,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:01,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:01,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:01,013 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:01,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:16:02,369 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ccdc73d3/c92b947d5b5746ea849f0136a73e8daf/FLAG7d9e74a3a [2025-04-29 11:16:02,551 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:02,552 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:16:02,554 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:02,554 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:02,554 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:02,559 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ccdc73d3/c92b947d5b5746ea849f0136a73e8daf/FLAG7d9e74a3a [2025-04-29 11:16:03,371 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ccdc73d3/c92b947d5b5746ea849f0136a73e8daf [2025-04-29 11:16:03,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:03,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:03,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:03,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:03,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:03,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dbcd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03, skipping insertion in model container [2025-04-29 11:16:03,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:03,575 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:03,592 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:03,626 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:03,642 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:03,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03 WrapperNode [2025-04-29 11:16:03,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:03,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:03,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:03,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:03,649 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:16:03" (1/1) ... [2025-04-29 11:16:03,659 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:16:03" (1/1) ... [2025-04-29 11:16:03,681 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2025-04-29 11:16:03,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:03,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:03,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:03,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:03,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,712 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [1, 12]. 92 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 9 writes are split as follows [0, 9]. [2025-04-29 11:16:03,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:03,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:03,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:03,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:03,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (1/1) ... [2025-04-29 11:16:03,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:03,776 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:16:03,778 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:16:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-29 11:16:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-04-29 11:16:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:16:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:16:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:16:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-29 11:16:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-04-29 11:16:03,804 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:16:03,886 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:03,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:04,213 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:16:04,213 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:04,360 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:04,360 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:16:04,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:04 BoogieIcfgContainer [2025-04-29 11:16:04,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:04,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:04,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:04,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:04,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:03" (1/3) ... [2025-04-29 11:16:04,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea519a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:04, skipping insertion in model container [2025-04-29 11:16:04,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:03" (2/3) ... [2025-04-29 11:16:04,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea519a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:04, skipping insertion in model container [2025-04-29 11:16:04,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:04" (3/3) ... [2025-04-29 11:16:04,367 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.c [2025-04-29 11:16:04,378 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:04,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.c that has 2 procedures, 52 locations, 50 edges, 1 initial locations, 0 loop locations, and 25 error locations. [2025-04-29 11:16:04,379 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:16:04,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:16:04,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-04-29 11:16:04,485 INFO L116 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-04-29 11:16:04,487 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:16:04,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-04-29 11:16:04,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-04-29 11:16:04,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:04,506 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;@2908ebae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:04,506 INFO L341 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-04-29 11:16:04,508 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:16:04,508 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-29 11:16:04,508 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:04,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:04,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:04,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 7198, now seen corresponding path program 1 times [2025-04-29 11:16:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:04,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441022356] [2025-04-29 11:16:04,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:04,527 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:16:04,528 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:16:04,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:04,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:04,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:16:04,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:04,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:04,653 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:16:04,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:04,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:04,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441022356] [2025-04-29 11:16:04,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441022356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570756074] [2025-04-29 11:16:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:04,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:04,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:04,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-29 11:16:04,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:16:04,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-29 11:16:04,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,873 INFO L116 PetriNetUnfolderBase]: 42/172 cut-off events. [2025-04-29 11:16:04,873 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 172 events. 42/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 745 event pairs, 42 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 256. Up to 101 conditions per place. [2025-04-29 11:16:04,877 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-29 11:16:04,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-04-29 11:16:04,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-29 11:16:04,890 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-04-29 11:16:04,891 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-04-29 11:16:04,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-04-29 11:16:04,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:04,895 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-04-29 11:16:04,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-29 11:16:04,899 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-29 11:16:04,899 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-04-29 11:16:04,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:16:04,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:04,906 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:16:05,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:05,102 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:05,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 7199, now seen corresponding path program 1 times [2025-04-29 11:16:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:05,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893173392] [2025-04-29 11:16:05,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:05,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:05,106 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:16:05,107 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:16:05,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:05,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:05,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:05,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:05,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:05,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:05,170 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:16:05,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:05,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:05,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893173392] [2025-04-29 11:16:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893173392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849547214] [2025-04-29 11:16:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:05,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:05,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:05,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-29 11:16:05,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:16:05,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:05,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-29 11:16:05,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:05,370 INFO L116 PetriNetUnfolderBase]: 42/168 cut-off events. [2025-04-29 11:16:05,371 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:05,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 168 events. 42/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 736 event pairs, 42 based on Foata normal form. 3/138 useless extension candidates. Maximal degree in co-relation 264. Up to 101 conditions per place. [2025-04-29 11:16:05,372 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-29 11:16:05,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-04-29 11:16:05,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-29 11:16:05,373 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-29 11:16:05,373 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-04-29 11:16:05,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-04-29 11:16:05,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:05,374 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-04-29 11:16:05,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-29 11:16:05,375 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-04-29 11:16:05,375 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-04-29 11:16:05,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:16:05,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:05,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:05,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:05,575 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 [2025-04-29 11:16:05,576 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:05,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1936686558, now seen corresponding path program 1 times [2025-04-29 11:16:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:05,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607390388] [2025-04-29 11:16:05,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:05,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:05,580 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:16:05,581 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:16:05,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:05,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:05,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:05,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:16:05,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:05,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:05,670 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:16:05,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:05,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:05,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607390388] [2025-04-29 11:16:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607390388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230699018] [2025-04-29 11:16:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:05,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:05,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:05,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-04-29 11:16:05,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:16:05,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:05,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-04-29 11:16:05,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:05,811 INFO L116 PetriNetUnfolderBase]: 49/174 cut-off events. [2025-04-29 11:16:05,812 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:05,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 174 events. 49/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 728 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 285. Up to 116 conditions per place. [2025-04-29 11:16:05,813 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-04-29 11:16:05,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 120 flow [2025-04-29 11:16:05,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-04-29 11:16:05,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2025-04-29 11:16:05,814 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 107 transitions. [2025-04-29 11:16:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 120 flow [2025-04-29 11:16:05,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:05,815 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 80 flow [2025-04-29 11:16:05,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-04-29 11:16:05,815 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-04-29 11:16:05,815 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 80 flow [2025-04-29 11:16:05,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:16:05,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:05,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:05,823 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:16:06,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,016 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:06,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1936686557, now seen corresponding path program 1 times [2025-04-29 11:16:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:06,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719762102] [2025-04-29 11:16:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:06,019 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:16:06,019 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:16:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:06,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:06,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:06,111 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:16:06,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:06,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:06,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719762102] [2025-04-29 11:16:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719762102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285543500] [2025-04-29 11:16:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:06,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:06,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:06,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:06,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-29 11:16:06,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:16:06,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-29 11:16:06,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:06,269 INFO L116 PetriNetUnfolderBase]: 42/144 cut-off events. [2025-04-29 11:16:06,269 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:06,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 144 events. 42/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 545 event pairs, 42 based on Foata normal form. 8/135 useless extension candidates. Maximal degree in co-relation 243. Up to 101 conditions per place. [2025-04-29 11:16:06,270 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-04-29 11:16:06,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 108 flow [2025-04-29 11:16:06,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-29 11:16:06,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-29 11:16:06,271 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 80 flow. Second operand 3 states and 109 transitions. [2025-04-29 11:16:06,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 108 flow [2025-04-29 11:16:06,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:06,272 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-04-29 11:16:06,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-04-29 11:16:06,273 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-04-29 11:16:06,273 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-04-29 11:16:06,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:16:06,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:06,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:06,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:06,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,474 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:06,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1533251076, now seen corresponding path program 1 times [2025-04-29 11:16:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:06,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300002571] [2025-04-29 11:16:06,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:06,476 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:16:06,477 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:16:06,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:06,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:06,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:16:06,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:06,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:06,553 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:16:06,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:06,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:06,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300002571] [2025-04-29 11:16:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300002571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588624994] [2025-04-29 11:16:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:06,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:06,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:06,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:06,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-04-29 11:16:06,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:16:06,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-04-29 11:16:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:06,691 INFO L116 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-04-29 11:16:06,692 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 166 events. 49/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 683 event pairs, 35 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 280. Up to 88 conditions per place. [2025-04-29 11:16:06,694 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-04-29 11:16:06,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-04-29 11:16:06,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-04-29 11:16:06,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-04-29 11:16:06,695 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-04-29 11:16:06,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-04-29 11:16:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:06,696 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-04-29 11:16:06,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-04-29 11:16:06,696 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-04-29 11:16:06,696 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-04-29 11:16:06,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:16:06,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:06,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:06,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:16:06,897 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 [2025-04-29 11:16:06,897 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:06,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1533251075, now seen corresponding path program 1 times [2025-04-29 11:16:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:06,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294267898] [2025-04-29 11:16:06,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:06,900 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:16:06,900 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:16:06,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:06,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:06,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:06,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:06,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:06,994 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:16:06,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:06,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:06,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294267898] [2025-04-29 11:16:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294267898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829548980] [2025-04-29 11:16:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:06,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:06,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:06,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:07,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-04-29 11:16:07,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:16:07,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:07,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-04-29 11:16:07,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,162 INFO L116 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-04-29 11:16:07,162 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:16:07,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 143 events. 42/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 541 event pairs, 35 based on Foata normal form. 16/147 useless extension candidates. Maximal degree in co-relation 258. Up to 88 conditions per place. [2025-04-29 11:16:07,163 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-29 11:16:07,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-04-29 11:16:07,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-29 11:16:07,164 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-04-29 11:16:07,164 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-04-29 11:16:07,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-04-29 11:16:07,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:07,165 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-04-29 11:16:07,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-04-29 11:16:07,166 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-04-29 11:16:07,166 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-04-29 11:16:07,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:16:07,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:07,173 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:16:07,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,367 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:07,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -142189103, now seen corresponding path program 1 times [2025-04-29 11:16:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:07,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061813596] [2025-04-29 11:16:07,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:07,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:07,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:16:07,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:07,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:07,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:16:07,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:07,484 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:07,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:07,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:07,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-29 11:16:07,588 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:16:07,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:07,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:07,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061813596] [2025-04-29 11:16:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061813596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732592315] [2025-04-29 11:16:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:07,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:07,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:07,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-04-29 11:16:07,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:16:07,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:07,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-04-29 11:16:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:08,015 INFO L116 PetriNetUnfolderBase]: 98/267 cut-off events. [2025-04-29 11:16:08,015 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-29 11:16:08,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 267 events. 98/267 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1170 event pairs, 6 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 508. Up to 99 conditions per place. [2025-04-29 11:16:08,017 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 41 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2025-04-29 11:16:08,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 230 flow [2025-04-29 11:16:08,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-04-29 11:16:08,019 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5994397759103641 [2025-04-29 11:16:08,019 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 7 states and 214 transitions. [2025-04-29 11:16:08,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 230 flow [2025-04-29 11:16:08,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:08,022 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 116 flow [2025-04-29 11:16:08,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-04-29 11:16:08,023 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-04-29 11:16:08,023 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 116 flow [2025-04-29 11:16:08,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:16:08,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:08,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:08,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:16:08,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:08,225 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:08,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -142189102, now seen corresponding path program 1 times [2025-04-29 11:16:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:08,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949628267] [2025-04-29 11:16:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:08,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:08,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:08,228 INFO L229 MonitoredProcess]: Starting monitored process 9 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:16:08,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:16:08,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:16:08,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:16:08,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:08,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:16:08,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:08,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:08,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:08,346 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:16:08,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-29 11:16:08,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:08,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:08,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:08,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:16:08,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:08,477 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:16:08,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:08,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:08,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949628267] [2025-04-29 11:16:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949628267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174204303] [2025-04-29 11:16:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:08,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:08,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:08,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:08,744 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-04-29 11:16:08,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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:16:08,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:08,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-04-29 11:16:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:08,994 INFO L116 PetriNetUnfolderBase]: 105/272 cut-off events. [2025-04-29 11:16:08,995 INFO L117 PetriNetUnfolderBase]: For 85/87 co-relation queries the response was YES. [2025-04-29 11:16:08,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 272 events. 105/272 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1168 event pairs, 5 based on Foata normal form. 12/277 useless extension candidates. Maximal degree in co-relation 612. Up to 115 conditions per place. [2025-04-29 11:16:08,996 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 43 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2025-04-29 11:16:08,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 278 flow [2025-04-29 11:16:08,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-04-29 11:16:08,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-29 11:16:08,998 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 116 flow. Second operand 7 states and 210 transitions. [2025-04-29 11:16:08,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 278 flow [2025-04-29 11:16:08,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:08,999 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 155 flow [2025-04-29 11:16:08,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-04-29 11:16:09,000 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-29 11:16:09,000 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 155 flow [2025-04-29 11:16:09,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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:16:09,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:09,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:09,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:16:09,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:09,201 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:09,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 613233649, now seen corresponding path program 1 times [2025-04-29 11:16:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:09,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822224622] [2025-04-29 11:16:09,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:09,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:09,205 INFO L229 MonitoredProcess]: Starting monitored process 10 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:16:09,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:16:09,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:16:09,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:16:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:09,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:16:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:09,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:09,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:09,327 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:09,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:09,347 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-29 11:16:09,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:16:09,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:16:09,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:16:09,472 INFO L325 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2025-04-29 11:16:09,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:16:09,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:16:09,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-04-29 11:16:09,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:16:09,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:16:09,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:09,621 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:16:09,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:09,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:09,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822224622] [2025-04-29 11:16:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822224622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:09,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921766251] [2025-04-29 11:16:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:09,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:16:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:16:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:16:10,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-29 11:16:10,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 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:16:10,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:10,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-29 11:16:10,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:10,308 INFO L116 PetriNetUnfolderBase]: 109/296 cut-off events. [2025-04-29 11:16:10,308 INFO L117 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-04-29 11:16:10,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 296 events. 109/296 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1326 event pairs, 16 based on Foata normal form. 16/301 useless extension candidates. Maximal degree in co-relation 710. Up to 81 conditions per place. [2025-04-29 11:16:10,310 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 48 selfloop transitions, 17 changer transitions 0/70 dead transitions. [2025-04-29 11:16:10,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 418 flow [2025-04-29 11:16:10,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2025-04-29 11:16:10,311 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5546218487394958 [2025-04-29 11:16:10,311 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 155 flow. Second operand 7 states and 198 transitions. [2025-04-29 11:16:10,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 418 flow [2025-04-29 11:16:10,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 372 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:10,314 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 242 flow [2025-04-29 11:16:10,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2025-04-29 11:16:10,314 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-04-29 11:16:10,314 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 242 flow [2025-04-29 11:16:10,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 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:16:10,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:10,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:10,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:16:10,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,515 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:10,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -486715613, now seen corresponding path program 1 times [2025-04-29 11:16:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:10,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169358166] [2025-04-29 11:16:10,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:10,517 INFO L229 MonitoredProcess]: Starting monitored process 11 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:16:10,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:16:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:10,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:10,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:10,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:16:10,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:10,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:16:10,624 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:16:10,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:10,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:10,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169358166] [2025-04-29 11:16:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169358166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327504212] [2025-04-29 11:16:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:10,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:10,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:10,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:10,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-04-29 11:16:10,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:16:10,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:10,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-04-29 11:16:10,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:10,756 INFO L116 PetriNetUnfolderBase]: 91/253 cut-off events. [2025-04-29 11:16:10,757 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-29 11:16:10,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 253 events. 91/253 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1099 event pairs, 38 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 696. Up to 191 conditions per place. [2025-04-29 11:16:10,758 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 37 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-04-29 11:16:10,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 336 flow [2025-04-29 11:16:10,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-29 11:16:10,759 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-04-29 11:16:10,759 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 242 flow. Second operand 3 states and 120 transitions. [2025-04-29 11:16:10,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 336 flow [2025-04-29 11:16:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:16:10,761 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 244 flow [2025-04-29 11:16:10,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-04-29 11:16:10,761 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-04-29 11:16:10,762 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 244 flow [2025-04-29 11:16:10,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:16:10,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:10,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:10,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:16:10,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,962 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:10,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -486715612, now seen corresponding path program 1 times [2025-04-29 11:16:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:10,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060751556] [2025-04-29 11:16:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:10,965 INFO L229 MonitoredProcess]: Starting monitored process 12 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:16:10,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:16:11,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:11,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:11,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:11,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:11,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:11,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:11,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:11,074 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:16:11,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:11,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:16:11,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060751556] [2025-04-29 11:16:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060751556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542652890] [2025-04-29 11:16:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:11,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:16:11,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:11,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:11,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 51 [2025-04-29 11:16:11,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:16:11,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:11,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 51 [2025-04-29 11:16:11,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:11,231 INFO L116 PetriNetUnfolderBase]: 76/216 cut-off events. [2025-04-29 11:16:11,231 INFO L117 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-04-29 11:16:11,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 216 events. 76/216 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 906 event pairs, 40 based on Foata normal form. 14/226 useless extension candidates. Maximal degree in co-relation 599. Up to 160 conditions per place. [2025-04-29 11:16:11,233 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 26 selfloop transitions, 1 changer transitions 13/51 dead transitions. [2025-04-29 11:16:11,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 336 flow [2025-04-29 11:16:11,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-04-29 11:16:11,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2025-04-29 11:16:11,234 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 244 flow. Second operand 3 states and 122 transitions. [2025-04-29 11:16:11,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 336 flow [2025-04-29 11:16:11,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:11,237 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 155 flow [2025-04-29 11:16:11,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2025-04-29 11:16:11,238 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-04-29 11:16:11,238 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 155 flow [2025-04-29 11:16:11,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:16:11,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:11,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:11,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:16:11,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:11,438 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-29 11:16:11,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1117526673, now seen corresponding path program 1 times [2025-04-29 11:16:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:16:11,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426689396] [2025-04-29 11:16:11,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:11,441 INFO L229 MonitoredProcess]: Starting monitored process 13 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:16:11,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:16:11,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:11,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:16:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:12,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:12,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:12,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:12,108 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-29 11:16:12,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:16:12,109 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-04-29 11:16:12,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-04-29 11:16:12,111 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-04-29 11:16:12,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:12,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:12,312 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:12,347 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:16:12,347 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:16:12,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:16:12 BasicIcfg [2025-04-29 11:16:12,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:16:12,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:16:12,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:16:12,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:16:12,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:04" (3/4) ... [2025-04-29 11:16:12,352 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:16:12,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:16:12,353 INFO L158 Benchmark]: Toolchain (without parser) took 8978.93ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 85.7MB in the end (delta: 6.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.96ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.84ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: Boogie Preprocessor took 58.19ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: RCFGBuilder took 620.11ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 89.3MB in the end (delta: -15.4MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,353 INFO L158 Benchmark]: TraceAbstraction took 7987.88ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 85.7MB in the end (delta: 3.6MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,354 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 85.7MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,358 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.17ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.96ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.84ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.19ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 620.11ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 89.3MB in the end (delta: -15.4MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7987.88ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 85.7MB in the end (delta: 3.6MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 85.7MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 38]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 38. Possible FailurePath: [L12-L15] 0 struct s { int datum; struct s *next; } *A; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L22] 0 pthread_mutex_t A_mutex = PTHREAD_MUTEX_INITIALIZER; [L23] 0 pthread_mutex_t B_mutex = PTHREAD_MUTEX_INITIALIZER; [L39] 0 pthread_t t1; [L40] 0 struct s *p = malloc(sizeof(struct s)); [L41] CALL 0 init(p,9) [L18] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B_mutex=0] [L19] 0 p -> next = NULL [L41] RET 0 init(p,9) [L43] 0 A = malloc(sizeof(struct s)) [L44] CALL 0 init(A,3) [L18] 0 p -> datum = x VAL [A={3:0}, A_mutex={1:0}, B_mutex=0] [L19] 0 p -> next = NULL [L44] RET 0 init(A,3) [L45] 0 A->next = p [L47] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [A={3:0}, A_mutex={1:0}, B_mutex=0, p={131074:0}, t1=0] [L50] EXPR 0 A->next [L50] 0 p = A->next [L51] 0 p->datum [L53] 0 return 0; VAL [A={3:0}, A_mutex={1:0}, B_mutex=0, \result=0, p={131074:0}, t1=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 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: 7.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1102 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1548 IncrementalHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 67 mSDtfsCounter, 1548 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1276 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:16:12,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample