./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i --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_09-arraylist.i -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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:29,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:29,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:29,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:29,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:29,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:29,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:29,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:29,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:29,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:29,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:29,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:29,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:29,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:29,269 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:29,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:29,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:29,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:29,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:29,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:29,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:29,272 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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-04-30 10:35:29,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:29,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:29,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:29,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:29,487 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:29,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2025-04-30 10:35:30,794 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545457daf/74980da7aaf34ffe91acc96476955fe9/FLAGbee688464 [2025-04-30 10:35:31,060 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:31,062 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.i [2025-04-30 10:35:31,077 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545457daf/74980da7aaf34ffe91acc96476955fe9/FLAGbee688464 [2025-04-30 10:35:31,844 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545457daf/74980da7aaf34ffe91acc96476955fe9 [2025-04-30 10:35:31,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:31,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:31,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:31,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:31,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:31,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:31" (1/1) ... [2025-04-30 10:35:31,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632f8630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:31, skipping insertion in model container [2025-04-30 10:35:31,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:31" (1/1) ... [2025-04-30 10:35:31,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:32,279 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:32,289 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:32,337 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:32,397 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:32,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32 WrapperNode [2025-04-30 10:35:32,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:32,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:32,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:32,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:32,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,449 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 130 [2025-04-30 10:35:32,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:32,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:32,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:32,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:32,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,487 INFO L175 MemorySlicer]: Split 33 memory accesses to 3 slices as follows [5, 14, 14]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [5, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-04-30 10:35:32,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:32,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:32,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:32,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:32,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:32,530 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-30 10:35:32,532 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-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:32,549 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:35:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:32,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:32,550 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:32,657 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:32,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:32,927 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:32,928 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:33,073 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:33,074 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:33,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:33 BoogieIcfgContainer [2025-04-30 10:35:33,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:33,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:33,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:33,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:33,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:31" (1/3) ... [2025-04-30 10:35:33,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744169d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:33, skipping insertion in model container [2025-04-30 10:35:33,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (2/3) ... [2025-04-30 10:35:33,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744169d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:33, skipping insertion in model container [2025-04-30 10:35:33,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:33" (3/3) ... [2025-04-30 10:35:33,080 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-04-30 10:35:33,090 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:33,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 71 locations, 70 edges, 1 initial locations, 1 loop locations, and 37 error locations. [2025-04-30 10:35:33,092 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:33,141 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:33,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-04-30 10:35:33,199 INFO L116 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-04-30 10:35:33,201 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 285 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-30 10:35:33,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-04-30 10:35:33,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-04-30 10:35:33,218 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:33,226 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;@20d989ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:33,226 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-30 10:35:33,229 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:33,229 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-30 10:35:33,229 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:35:33,230 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash 402616, now seen corresponding path program 1 times [2025-04-30 10:35:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153479993] [2025-04-30 10:35:33,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:35:33,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:35:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:33,457 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-30 10:35:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:33,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153479993] [2025-04-30 10:35:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153479993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:33,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090219263] [2025-04-30 10:35:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:33,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:33,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:33,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:33,559 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-04-30 10:35:33,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-30 10:35:33,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:33,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-04-30 10:35:33,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:33,668 INFO L116 PetriNetUnfolderBase]: 64/261 cut-off events. [2025-04-30 10:35:33,669 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 261 events. 64/261 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1343 event pairs, 63 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 376. Up to 151 conditions per place. [2025-04-30 10:35:33,671 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-30 10:35:33,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 191 flow [2025-04-30 10:35:33,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-04-30 10:35:33,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-04-30 10:35:33,681 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 149 transitions. [2025-04-30 10:35:33,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 191 flow [2025-04-30 10:35:33,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:33,687 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 142 flow [2025-04-30 10:35:33,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-04-30 10:35:33,693 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-04-30 10:35:33,693 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 142 flow [2025-04-30 10:35:33,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-30 10:35:33,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:35:33,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:33,694 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 402617, now seen corresponding path program 1 times [2025-04-30 10:35:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967261212] [2025-04-30 10:35:33,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:35:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:35:33,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:33,778 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-30 10:35:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:33,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967261212] [2025-04-30 10:35:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967261212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905099388] [2025-04-30 10:35:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:33,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:33,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:33,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:33,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-04-30 10:35:33,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-30 10:35:33,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:33,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-04-30 10:35:33,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:33,911 INFO L116 PetriNetUnfolderBase]: 64/257 cut-off events. [2025-04-30 10:35:33,911 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:33,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 257 events. 64/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1318 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 384. Up to 151 conditions per place. [2025-04-30 10:35:33,913 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 22 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-04-30 10:35:33,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 186 flow [2025-04-30 10:35:33,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-04-30 10:35:33,916 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-04-30 10:35:33,917 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2025-04-30 10:35:33,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 186 flow [2025-04-30 10:35:33,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:33,918 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 134 flow [2025-04-30 10:35:33,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-04-30 10:35:33,919 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-04-30 10:35:33,920 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 134 flow [2025-04-30 10:35:33,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-30 10:35:33,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:35:33,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:35:33,922 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 386925213, now seen corresponding path program 1 times [2025-04-30 10:35:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344058078] [2025-04-30 10:35:33,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:35:33,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:35:33,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:34,120 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-30 10:35:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:34,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344058078] [2025-04-30 10:35:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344058078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:34,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137313065] [2025-04-30 10:35:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:34,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:34,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:34,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:34,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-30 10:35:34,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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-30 10:35:34,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:34,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-30 10:35:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:34,354 INFO L116 PetriNetUnfolderBase]: 73/279 cut-off events. [2025-04-30 10:35:34,354 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:34,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 279 events. 73/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1428 event pairs, 72 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 427. Up to 173 conditions per place. [2025-04-30 10:35:34,358 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 28 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-04-30 10:35:34,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 184 flow [2025-04-30 10:35:34,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-04-30 10:35:34,361 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-04-30 10:35:34,361 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 134 flow. Second operand 3 states and 147 transitions. [2025-04-30 10:35:34,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 184 flow [2025-04-30 10:35:34,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:34,363 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 120 flow [2025-04-30 10:35:34,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-04-30 10:35:34,363 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2025-04-30 10:35:34,363 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 120 flow [2025-04-30 10:35:34,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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-30 10:35:34,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:34,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:35:34,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:34,365 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:34,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 386925214, now seen corresponding path program 1 times [2025-04-30 10:35:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:34,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128663715] [2025-04-30 10:35:34,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:34,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:35:34,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:35:34,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:34,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:34,536 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-30 10:35:34,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:34,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128663715] [2025-04-30 10:35:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128663715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838225998] [2025-04-30 10:35:34,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:34,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:34,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:34,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:34,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 71 [2025-04-30 10:35:34,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-30 10:35:34,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:34,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 71 [2025-04-30 10:35:34,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:34,786 INFO L116 PetriNetUnfolderBase]: 64/265 cut-off events. [2025-04-30 10:35:34,786 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:34,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 265 events. 64/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1244 event pairs, 63 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 426. Up to 155 conditions per place. [2025-04-30 10:35:34,789 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 29 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2025-04-30 10:35:34,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 204 flow [2025-04-30 10:35:34,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-04-30 10:35:34,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6267605633802817 [2025-04-30 10:35:34,791 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 120 flow. Second operand 4 states and 178 transitions. [2025-04-30 10:35:34,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 204 flow [2025-04-30 10:35:34,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:34,795 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 167 flow [2025-04-30 10:35:34,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-04-30 10:35:34,796 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-04-30 10:35:34,796 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 167 flow [2025-04-30 10:35:34,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-30 10:35:34,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:34,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:34,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:35:34,797 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:34,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash 883786832, now seen corresponding path program 1 times [2025-04-30 10:35:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:34,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322782038] [2025-04-30 10:35:34,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:34,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:34,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:34,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:34,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:35,020 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-30 10:35:35,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:35,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322782038] [2025-04-30 10:35:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322782038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:35,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338808121] [2025-04-30 10:35:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:35,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:35,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:35,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:35,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:35,225 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-04-30 10:35:35,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 167 flow. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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-30 10:35:35,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:35,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-04-30 10:35:35,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:35,326 INFO L116 PetriNetUnfolderBase]: 64/261 cut-off events. [2025-04-30 10:35:35,326 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:35,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 261 events. 64/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1215 event pairs, 63 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 444. Up to 148 conditions per place. [2025-04-30 10:35:35,328 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 23 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2025-04-30 10:35:35,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 231 flow [2025-04-30 10:35:35,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-04-30 10:35:35,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5694164989939637 [2025-04-30 10:35:35,329 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 167 flow. Second operand 7 states and 283 transitions. [2025-04-30 10:35:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 231 flow [2025-04-30 10:35:35,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:35,331 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 183 flow [2025-04-30 10:35:35,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-04-30 10:35:35,331 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-04-30 10:35:35,331 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 183 flow [2025-04-30 10:35:35,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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-30 10:35:35,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:35,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:35,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:35,332 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:35,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 883786833, now seen corresponding path program 1 times [2025-04-30 10:35:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:35,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273674885] [2025-04-30 10:35:35,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:35,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:35,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:35,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:35,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:35,630 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-30 10:35:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:35,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273674885] [2025-04-30 10:35:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273674885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363802019] [2025-04-30 10:35:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:35,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:35,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:35,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:35,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-04-30 10:35:35,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-30 10:35:35,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:35,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-04-30 10:35:35,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:35,921 INFO L116 PetriNetUnfolderBase]: 64/257 cut-off events. [2025-04-30 10:35:35,922 INFO L117 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-04-30 10:35:35,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 257 events. 64/257 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1190 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 445. Up to 148 conditions per place. [2025-04-30 10:35:35,924 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 20 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2025-04-30 10:35:35,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 241 flow [2025-04-30 10:35:35,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 301 transitions. [2025-04-30 10:35:35,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6056338028169014 [2025-04-30 10:35:35,925 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 183 flow. Second operand 7 states and 301 transitions. [2025-04-30 10:35:35,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 241 flow [2025-04-30 10:35:35,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:35,928 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 179 flow [2025-04-30 10:35:35,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-04-30 10:35:35,928 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-04-30 10:35:35,928 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 179 flow [2025-04-30 10:35:35,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-30 10:35:35,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:35,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:35,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:35,929 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:35,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1084364114, now seen corresponding path program 1 times [2025-04-30 10:35:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:35,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945138898] [2025-04-30 10:35:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:35,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:35:35,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:35:35,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:35,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,011 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-30 10:35:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945138898] [2025-04-30 10:35:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945138898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75973490] [2025-04-30 10:35:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:36,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-30 10:35:36,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-30 10:35:36,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-30 10:35:36,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,214 INFO L116 PetriNetUnfolderBase]: 64/255 cut-off events. [2025-04-30 10:35:36,214 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:35:36,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 255 events. 64/255 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1181 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 447. Up to 150 conditions per place. [2025-04-30 10:35:36,215 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 22 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2025-04-30 10:35:36,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 243 flow [2025-04-30 10:35:36,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-04-30 10:35:36,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-04-30 10:35:36,216 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 179 flow. Second operand 5 states and 219 transitions. [2025-04-30 10:35:36,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 243 flow [2025-04-30 10:35:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:36,217 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 177 flow [2025-04-30 10:35:36,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-04-30 10:35:36,218 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-04-30 10:35:36,218 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 177 flow [2025-04-30 10:35:36,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-30 10:35:36,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:36,218 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1084364113, now seen corresponding path program 1 times [2025-04-30 10:35:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510860430] [2025-04-30 10:35:36,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:35:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:35:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,328 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-30 10:35:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510860430] [2025-04-30 10:35:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510860430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131806689] [2025-04-30 10:35:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:36,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:36,412 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-04-30 10:35:36,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-30 10:35:36,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-04-30 10:35:36,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,495 INFO L116 PetriNetUnfolderBase]: 64/253 cut-off events. [2025-04-30 10:35:36,495 INFO L117 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-04-30 10:35:36,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 253 events. 64/253 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1167 event pairs, 63 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 441. Up to 150 conditions per place. [2025-04-30 10:35:36,496 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2025-04-30 10:35:36,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 237 flow [2025-04-30 10:35:36,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-04-30 10:35:36,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2025-04-30 10:35:36,497 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 177 flow. Second operand 5 states and 227 transitions. [2025-04-30 10:35:36,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 237 flow [2025-04-30 10:35:36,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:36,499 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 175 flow [2025-04-30 10:35:36,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-04-30 10:35:36,500 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-04-30 10:35:36,500 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 175 flow [2025-04-30 10:35:36,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-30 10:35:36,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:36,501 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1262498120, now seen corresponding path program 1 times [2025-04-30 10:35:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626721490] [2025-04-30 10:35:36,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:36,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:36,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626721490] [2025-04-30 10:35:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626721490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:36,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043944718] [2025-04-30 10:35:36,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:36,762 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-30 10:35:36,764 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-30 10:35:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:36,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:36,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-30 10:35:36,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:36,940 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:35:36,940 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 11 treesize of output 11 [2025-04-30 10:35:36,951 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-30 10:35:37,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:37,010 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-30 10:35:37,021 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 15 treesize of output 1 [2025-04-30 10:35:37,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:37,112 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-30 10:35:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:37,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:37,329 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:37,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:37,392 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:37,393 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 12 [2025-04-30 10:35:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043944718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:37,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:37,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-04-30 10:35:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047246751] [2025-04-30 10:35:37,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:35:37,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:35:37,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:35:38,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-04-30 10:35:38,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 175 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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-30 10:35:38,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-04-30 10:35:38,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,274 INFO L116 PetriNetUnfolderBase]: 75/308 cut-off events. [2025-04-30 10:35:39,274 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-30 10:35:39,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 308 events. 75/308 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1451 event pairs, 72 based on Foata normal form. 7/267 useless extension candidates. Maximal degree in co-relation 564. Up to 170 conditions per place. [2025-04-30 10:35:39,275 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2025-04-30 10:35:39,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 383 flow [2025-04-30 10:35:39,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:35:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:35:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 367 transitions. [2025-04-30 10:35:39,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5743348982785602 [2025-04-30 10:35:39,278 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 175 flow. Second operand 9 states and 367 transitions. [2025-04-30 10:35:39,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 383 flow [2025-04-30 10:35:39,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:39,280 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 257 flow [2025-04-30 10:35:39,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-04-30 10:35:39,280 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-04-30 10:35:39,280 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 257 flow [2025-04-30 10:35:39,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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-30 10:35:39,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:39,289 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-30 10:35:39,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:39,481 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:39,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1248969985, now seen corresponding path program 1 times [2025-04-30 10:35:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41491504] [2025-04-30 10:35:39,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:35:39,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:35:39,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:39,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41491504] [2025-04-30 10:35:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41491504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:39,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257192777] [2025-04-30 10:35:39,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:39,588 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-30 10:35:39,589 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-30 10:35:39,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:35:39,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:35:39,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:35:39,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:39,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257192777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:39,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-30 10:35:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322375452] [2025-04-30 10:35:39,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:39,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:39,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:39,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-30 10:35:39,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 49.77777777777778) internal successors, (448), 9 states have internal predecessors, (448), 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-30 10:35:39,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-30 10:35:39,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,933 INFO L116 PetriNetUnfolderBase]: 64/294 cut-off events. [2025-04-30 10:35:39,933 INFO L117 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-04-30 10:35:39,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 294 events. 64/294 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1110 event pairs, 63 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 571. Up to 146 conditions per place. [2025-04-30 10:35:39,935 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 54 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-04-30 10:35:39,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 477 flow [2025-04-30 10:35:39,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 426 transitions. [2025-04-30 10:35:39,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-04-30 10:35:39,936 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 257 flow. Second operand 8 states and 426 transitions. [2025-04-30 10:35:39,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 477 flow [2025-04-30 10:35:39,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 457 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:39,939 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 273 flow [2025-04-30 10:35:39,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=273, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2025-04-30 10:35:39,939 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-04-30 10:35:39,939 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 273 flow [2025-04-30 10:35:39,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 49.77777777777778) internal successors, (448), 9 states have internal predecessors, (448), 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-30 10:35:39,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,940 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-04-30 10:35:39,947 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-30 10:35:40,145 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,SelfDestructingSolverStorable9 [2025-04-30 10:35:40,145 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:40,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash 492609542, now seen corresponding path program 2 times [2025-04-30 10:35:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:40,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504632020] [2025-04-30 10:35:40,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:40,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:35:40,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:35:40,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:41,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504632020] [2025-04-30 10:35:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504632020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:41,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468003031] [2025-04-30 10:35:41,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:41,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:41,421 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-30 10:35:41,423 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-30 10:35:41,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:35:41,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:35:41,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:41,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-30 10:35:41,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:41,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:41,680 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-30 10:35:41,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:41,718 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-30 10:35:41,787 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:35:41,787 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 11 treesize of output 11 [2025-04-30 10:35:41,794 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-30 10:35:41,859 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 15 treesize of output 1 [2025-04-30 10:35:41,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:41,866 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-30 10:35:41,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:41,962 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-30 10:35:42,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:42,014 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-30 10:35:42,083 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:35:42,084 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 11 treesize of output 11 [2025-04-30 10:35:42,089 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-30 10:35:42,163 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 15 treesize of output 1 [2025-04-30 10:35:42,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:42,167 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-30 10:35:42,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:42,272 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-30 10:35:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:42,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:42,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:42,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:42,554 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:42,554 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 12 [2025-04-30 10:35:42,716 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:42,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:42,784 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:42,784 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 12 [2025-04-30 10:35:42,961 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:42,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:43,026 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:43,026 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 12 [2025-04-30 10:35:43,192 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:43,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-30 10:35:43,254 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:35:43,254 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 12 [2025-04-30 10:35:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468003031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:43,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 10] total 40 [2025-04-30 10:35:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430021080] [2025-04-30 10:35:43,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:43,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-30 10:35:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:43,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-30 10:35:43,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:35:48,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-04-30 10:35:48,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 273 flow. Second operand has 42 states, 42 states have (on average 36.285714285714285) internal successors, (1524), 42 states have internal predecessors, (1524), 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-30 10:35:48,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:48,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-04-30 10:35:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:49,927 INFO L116 PetriNetUnfolderBase]: 77/370 cut-off events. [2025-04-30 10:35:49,927 INFO L117 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-04-30 10:35:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 370 events. 77/370 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1452 event pairs, 72 based on Foata normal form. 6/328 useless extension candidates. Maximal degree in co-relation 789. Up to 172 conditions per place. [2025-04-30 10:35:49,929 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 70 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2025-04-30 10:35:49,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 121 transitions, 803 flow [2025-04-30 10:35:49,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:35:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:35:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 818 transitions. [2025-04-30 10:35:49,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5486250838363514 [2025-04-30 10:35:49,931 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 273 flow. Second operand 21 states and 818 transitions. [2025-04-30 10:35:49,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 121 transitions, 803 flow [2025-04-30 10:35:49,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 121 transitions, 787 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-30 10:35:49,935 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 501 flow [2025-04-30 10:35:49,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=501, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2025-04-30 10:35:49,937 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 34 predicate places. [2025-04-30 10:35:49,937 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 501 flow [2025-04-30 10:35:49,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 36.285714285714285) internal successors, (1524), 42 states have internal predecessors, (1524), 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-30 10:35:49,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:49,938 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:49,945 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-30 10:35:50,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:50,139 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:50,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1241340519, now seen corresponding path program 2 times [2025-04-30 10:35:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:50,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241905296] [2025-04-30 10:35:50,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:50,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-04-30 10:35:50,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:35:50,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:50,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:50,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241905296] [2025-04-30 10:35:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241905296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:50,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945360299] [2025-04-30 10:35:50,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:50,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:50,396 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-30 10:35:50,398 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-30 10:35:50,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-04-30 10:35:50,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:35:50,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:50,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:35:50,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945360299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:50,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-30 10:35:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867638335] [2025-04-30 10:35:50,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:50,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:50,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:50,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:50,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-30 10:35:50,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 501 flow. Second operand has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-30 10:35:50,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:50,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-30 10:35:50,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:50,970 INFO L116 PetriNetUnfolderBase]: 64/336 cut-off events. [2025-04-30 10:35:50,971 INFO L117 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-04-30 10:35:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 336 events. 64/336 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1107 event pairs, 63 based on Foata normal form. 4/296 useless extension candidates. Maximal degree in co-relation 774. Up to 146 conditions per place. [2025-04-30 10:35:50,972 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 79 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2025-04-30 10:35:50,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 861 flow [2025-04-30 10:35:50,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 634 transitions. [2025-04-30 10:35:50,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2025-04-30 10:35:50,974 INFO L175 Difference]: Start difference. First operand has 107 places, 79 transitions, 501 flow. Second operand 12 states and 634 transitions. [2025-04-30 10:35:50,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 861 flow [2025-04-30 10:35:50,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 807 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-30 10:35:50,977 INFO L231 Difference]: Finished difference. Result has 111 places, 76 transitions, 428 flow [2025-04-30 10:35:50,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=428, PETRI_PLACES=111, PETRI_TRANSITIONS=76} [2025-04-30 10:35:50,978 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 38 predicate places. [2025-04-30 10:35:50,978 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 76 transitions, 428 flow [2025-04-30 10:35:50,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-30 10:35:50,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:50,978 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-04-30 10:35:50,986 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-30 10:35:51,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:51,179 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:51,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 98495778, now seen corresponding path program 3 times [2025-04-30 10:35:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:51,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311282168] [2025-04-30 10:35:51,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:51,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-04-30 10:35:51,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:35:51,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:35:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:52,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311282168] [2025-04-30 10:35:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311282168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:52,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771916273] [2025-04-30 10:35:52,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:52,112 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-30 10:35:52,115 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-30 10:35:52,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. Killed by 15