./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.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/list-simple/dll2c_append_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:39:02,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:39:02,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:39:02,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:39:02,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:39:02,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:39:02,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:39:02,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:39:02,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:39:02,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:39:02,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:39:02,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:39:02,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:39:02,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:39:02,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:39:02,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:02,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:39:02,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:02,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:39:02,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:39:02,182 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-04-30 10:39:02,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:39:02,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:39:02,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:39:02,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:39:02,408 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:39:02,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2025-04-30 10:39:03,654 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560a84f2d/a0396c91ea6946a9a8c9ed3013db27fd/FLAGfeb9ea21c [2025-04-30 10:39:03,876 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:39:03,877 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2025-04-30 10:39:03,886 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560a84f2d/a0396c91ea6946a9a8c9ed3013db27fd/FLAGfeb9ea21c [2025-04-30 10:39:04,855 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560a84f2d/a0396c91ea6946a9a8c9ed3013db27fd [2025-04-30 10:39:04,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:39:04,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:39:04,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:39:04,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:39:04,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:39:04,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:39:04" (1/1) ... [2025-04-30 10:39:04,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae9d306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:04, skipping insertion in model container [2025-04-30 10:39:04,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:39:04" (1/1) ... [2025-04-30 10:39:04,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:39:05,158 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:39:05,173 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:39:05,215 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:39:05,237 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:39:05,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05 WrapperNode [2025-04-30 10:39:05,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:39:05,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:39:05,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:39:05,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:39:05,247 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:39:05" (1/1) ... [2025-04-30 10:39:05,262 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:39:05" (1/1) ... [2025-04-30 10:39:05,283 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 150 [2025-04-30 10:39:05,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:39:05,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:39:05,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:39:05,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:39:05,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,319 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-04-30 10:39:05,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:39:05,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:39:05,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:39:05,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:39:05,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (1/1) ... [2025-04-30 10:39:05,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:05,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:05,373 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:39:05,378 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:39:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:39:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:39:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:39:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:39:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:39:05,502 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:39:05,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:39:05,827 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-04-30 10:39:05,828 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:39:05,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:39:05,837 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:39:05,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:39:05 BoogieIcfgContainer [2025-04-30 10:39:05,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:39:05,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:39:05,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:39:05,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:39:05,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:39:04" (1/3) ... [2025-04-30 10:39:05,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd56695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:39:05, skipping insertion in model container [2025-04-30 10:39:05,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:05" (2/3) ... [2025-04-30 10:39:05,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd56695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:39:05, skipping insertion in model container [2025-04-30 10:39:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:39:05" (3/3) ... [2025-04-30 10:39:05,847 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-04-30 10:39:05,857 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:39:05,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 141 locations, 157 edges, 1 initial locations, 3 loop locations, and 64 error locations. [2025-04-30 10:39:05,886 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:39:05,893 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;@52af9a2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:39:05,894 INFO L341 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2025-04-30 10:39:05,897 INFO L278 IsEmpty]: Start isEmpty. Operand has 141 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 136 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:05,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:39:05,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:05,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:39:05,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:05,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash 895549427, now seen corresponding path program 1 times [2025-04-30 10:39:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:05,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016372056] [2025-04-30 10:39:05,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:05,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:39:05,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:39:05,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,184 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:39:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016372056] [2025-04-30 10:39:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016372056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:39:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055913578] [2025-04-30 10:39:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:06,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,208 INFO L87 Difference]: Start difference. First operand has 141 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 136 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:39:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,335 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2025-04-30 10:39:06,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:06,339 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:39:06,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,344 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:39:06,344 INFO L226 Difference]: Without dead ends: 134 [2025-04-30 10:39:06,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,348 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 223 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-30 10:39:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-04-30 10:39:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 129 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-04-30 10:39:06,376 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 6 [2025-04-30 10:39:06,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,376 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-04-30 10:39:06,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:39:06,376 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-04-30 10:39:06,376 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:39:06,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:39:06,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:39:06,377 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:06,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash 895549426, now seen corresponding path program 1 times [2025-04-30 10:39:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172101437] [2025-04-30 10:39:06,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:39:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:39:06,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,421 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:39:06,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172101437] [2025-04-30 10:39:06,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172101437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:39:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652092403] [2025-04-30 10:39:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:06,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:06,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,423 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:39:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,498 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-04-30 10:39:06,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:06,498 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:39:06,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,499 INFO L225 Difference]: With dead ends: 131 [2025-04-30 10:39:06,499 INFO L226 Difference]: Without dead ends: 131 [2025-04-30 10:39:06,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,500 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 211 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-30 10:39:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-30 10:39:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-04-30 10:39:06,507 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 6 [2025-04-30 10:39:06,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,507 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-04-30 10:39:06,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:39:06,507 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-04-30 10:39:06,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:39:06,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:06,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:39:06,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:06,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1000748368, now seen corresponding path program 1 times [2025-04-30 10:39:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568187086] [2025-04-30 10:39:06,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:39:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:39:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,596 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:39:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568187086] [2025-04-30 10:39:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568187086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:39:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506600577] [2025-04-30 10:39:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,598 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:39:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,615 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2025-04-30 10:39:06,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:06,615 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-30 10:39:06,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,616 INFO L225 Difference]: With dead ends: 142 [2025-04-30 10:39:06,617 INFO L226 Difference]: Without dead ends: 142 [2025-04-30 10:39:06,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,617 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-30 10:39:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2025-04-30 10:39:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-04-30 10:39:06,625 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 14 [2025-04-30 10:39:06,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,625 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-04-30 10:39:06,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:39:06,626 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-04-30 10:39:06,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:39:06,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:06,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:39:06,626 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:06,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 228966693, now seen corresponding path program 1 times [2025-04-30 10:39:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817816282] [2025-04-30 10:39:06,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:39:06,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:39:06,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817816282] [2025-04-30 10:39:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817816282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623011419] [2025-04-30 10:39:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:06,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:06,771 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,967 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-04-30 10:39:06,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:06,968 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-30 10:39:06,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,969 INFO L225 Difference]: With dead ends: 131 [2025-04-30 10:39:06,969 INFO L226 Difference]: Without dead ends: 131 [2025-04-30 10:39:06,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:06,971 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 7 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 402 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-30 10:39:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-30 10:39:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-04-30 10:39:06,978 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2025-04-30 10:39:06,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,978 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-04-30 10:39:06,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:06,978 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-04-30 10:39:06,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:39:06,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:06,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:39:06,979 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:06,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 228966694, now seen corresponding path program 1 times [2025-04-30 10:39:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235930594] [2025-04-30 10:39:06,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:39:07,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:39:07,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235930594] [2025-04-30 10:39:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235930594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:07,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417721626] [2025-04-30 10:39:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:07,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:07,171 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:07,299 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2025-04-30 10:39:07,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:07,299 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-30 10:39:07,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:07,300 INFO L225 Difference]: With dead ends: 130 [2025-04-30 10:39:07,300 INFO L226 Difference]: Without dead ends: 130 [2025-04-30 10:39:07,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:07,301 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 9 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:07,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 477 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-30 10:39:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-04-30 10:39:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-04-30 10:39:07,324 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 24 [2025-04-30 10:39:07,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:07,324 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-04-30 10:39:07,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:07,324 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-04-30 10:39:07,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:39:07,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:07,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:07,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:39:07,325 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:07,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 993659430, now seen corresponding path program 1 times [2025-04-30 10:39:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:07,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262476746] [2025-04-30 10:39:07,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:07,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:07,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:07,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:07,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262476746] [2025-04-30 10:39:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262476746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:07,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941675702] [2025-04-30 10:39:07,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:07,548 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:39:07,549 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:39:07,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:07,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:07,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:39:07,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:07,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:07,712 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-30 10:39:07,738 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:39:07,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:39:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-30 10:39:07,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941675702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:07,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-04-30 10:39:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156363993] [2025-04-30 10:39:07,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:39:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:39:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-04-30 10:39:07,933 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-30 10:39:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:08,231 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-04-30 10:39:08,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:08,231 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-04-30 10:39:08,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:08,232 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:39:08,232 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:39:08,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-04-30 10:39:08,233 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:08,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 573 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 501 Invalid, 0 Unknown, 140 Unchecked, 0.3s Time] [2025-04-30 10:39:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:39:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-30 10:39:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8783783783783783) internal successors, (139), 129 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-04-30 10:39:08,239 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 26 [2025-04-30 10:39:08,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:08,240 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-04-30 10:39:08,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-30 10:39:08,240 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-04-30 10:39:08,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:39:08,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:08,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:08,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:39:08,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:39:08,441 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:08,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash 993659431, now seen corresponding path program 1 times [2025-04-30 10:39:08,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:08,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169401963] [2025-04-30 10:39:08,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:08,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:08,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:08,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:08,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169401963] [2025-04-30 10:39:08,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169401963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:08,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699112127] [2025-04-30 10:39:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:08,717 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:39:08,719 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:39:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:39:08,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:08,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:08,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:09,039 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:39:09,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:39:09,056 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:09,057 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:39:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:09,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699112127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:09,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2025-04-30 10:39:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787058349] [2025-04-30 10:39:09,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:09,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:39:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:09,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:39:09,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:39:09,238 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:09,746 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-04-30 10:39:09,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:39:09,747 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-04-30 10:39:09,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:09,747 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:39:09,747 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:39:09,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:39:09,748 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:09,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 819 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:39:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:39:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-30 10:39:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.864864864864865) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-04-30 10:39:09,752 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 26 [2025-04-30 10:39:09,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:09,753 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-04-30 10:39:09,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:09,753 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-04-30 10:39:09,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:39:09,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:09,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:09,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:39:09,958 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,SelfDestructingSolverStorable6 [2025-04-30 10:39:09,958 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:09,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1424127080, now seen corresponding path program 1 times [2025-04-30 10:39:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:09,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731749303] [2025-04-30 10:39:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:39:09,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:39:09,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:09,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:10,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731749303] [2025-04-30 10:39:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731749303] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:10,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985737627] [2025-04-30 10:39:10,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:10,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:10,043 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:39:10,044 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:39:10,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:39:10,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:39:10,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:10,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:39:10,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:10,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985737627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:10,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-30 10:39:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428553394] [2025-04-30 10:39:10,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:10,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:10,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:10,200 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:10,232 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2025-04-30 10:39:10,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:10,238 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-04-30 10:39:10,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:10,238 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:39:10,238 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:39:10,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:10,239 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:10,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 629 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:39:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-30 10:39:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2025-04-30 10:39:10,245 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 28 [2025-04-30 10:39:10,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:10,246 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2025-04-30 10:39:10,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:10,246 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2025-04-30 10:39:10,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:39:10,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:10,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:10,252 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:39:10,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:10,447 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:10,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1193468212, now seen corresponding path program 1 times [2025-04-30 10:39:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:10,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959341245] [2025-04-30 10:39:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:10,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:10,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:10,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:39:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:10,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959341245] [2025-04-30 10:39:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959341245] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:10,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772099988] [2025-04-30 10:39:10,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:10,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:10,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:10,509 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:39:10,511 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:39:10,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:10,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:10,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:10,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:39:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:10,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:10,649 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-30 10:39:10,687 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:39:10,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:39:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-30 10:39:10,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772099988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:10,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-30 10:39:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955817432] [2025-04-30 10:39:10,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:10,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:39:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:10,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:39:10,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-30 10:39:10,739 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:10,988 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-04-30 10:39:10,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:39:10,988 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-30 10:39:10,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:10,989 INFO L225 Difference]: With dead ends: 134 [2025-04-30 10:39:10,989 INFO L226 Difference]: Without dead ends: 134 [2025-04-30 10:39:10,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-04-30 10:39:10,989 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 9 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:10,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 625 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2025-04-30 10:39:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-30 10:39:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-04-30 10:39:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 74 states have (on average 1.837837837837838) internal successors, (136), 128 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2025-04-30 10:39:10,992 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 29 [2025-04-30 10:39:10,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:10,993 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2025-04-30 10:39:10,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:10,993 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2025-04-30 10:39:10,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:39:10,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:10,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:11,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:11,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:11,195 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:11,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1193468213, now seen corresponding path program 1 times [2025-04-30 10:39:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:11,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277642251] [2025-04-30 10:39:11,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:11,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:11,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:11,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277642251] [2025-04-30 10:39:11,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277642251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473513622] [2025-04-30 10:39:11,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:11,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:11,325 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:39:11,326 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:39:11,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:11,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:39:11,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:11,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:11,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:11,524 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-30 10:39:11,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:11,554 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:39:11,560 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:11,561 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:39:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-30 10:39:11,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473513622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:11,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-30 10:39:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447476444] [2025-04-30 10:39:11,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:11,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:39:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:11,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:39:11,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:39:11,677 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:11,999 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2025-04-30 10:39:11,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:39:11,999 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-30 10:39:11,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:12,001 INFO L225 Difference]: With dead ends: 151 [2025-04-30 10:39:12,001 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:39:12,001 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-04-30 10:39:12,002 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 16 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:12,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 833 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 528 Invalid, 0 Unknown, 159 Unchecked, 0.3s Time] [2025-04-30 10:39:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:39:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2025-04-30 10:39:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 83 states have (on average 1.8072289156626506) internal successors, (150), 137 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:39:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2025-04-30 10:39:12,005 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 29 [2025-04-30 10:39:12,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:12,005 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2025-04-30 10:39:12,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:12,005 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2025-04-30 10:39:12,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:39:12,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:12,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:39:12,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:39:12,207 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:12,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1657191093, now seen corresponding path program 1 times [2025-04-30 10:39:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:12,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161281747] [2025-04-30 10:39:12,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:39:12,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:39:12,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:12,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161281747] [2025-04-30 10:39:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161281747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262924160] [2025-04-30 10:39:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:12,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:12,279 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:12,434 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2025-04-30 10:39:12,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:12,435 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-30 10:39:12,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:12,435 INFO L225 Difference]: With dead ends: 143 [2025-04-30 10:39:12,435 INFO L226 Difference]: Without dead ends: 143 [2025-04-30 10:39:12,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:12,436 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:12,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 456 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-30 10:39:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-04-30 10:39:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 83 states have (on average 1.7951807228915662) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:39:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2025-04-30 10:39:12,439 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 30 [2025-04-30 10:39:12,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:12,439 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2025-04-30 10:39:12,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:12,439 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2025-04-30 10:39:12,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:39:12,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:12,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:12,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:39:12,440 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:12,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1657191092, now seen corresponding path program 1 times [2025-04-30 10:39:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:12,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803226900] [2025-04-30 10:39:12,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:12,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:39:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:39:12,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:12,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803226900] [2025-04-30 10:39:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803226900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:12,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995574599] [2025-04-30 10:39:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:12,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:12,571 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:12,739 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2025-04-30 10:39:12,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:12,739 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-30 10:39:12,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:12,740 INFO L225 Difference]: With dead ends: 142 [2025-04-30 10:39:12,740 INFO L226 Difference]: Without dead ends: 142 [2025-04-30 10:39:12,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:12,741 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:12,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 481 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-30 10:39:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-04-30 10:39:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 83 states have (on average 1.783132530120482) internal successors, (148), 135 states have internal predecessors, (148), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:39:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2025-04-30 10:39:12,744 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 30 [2025-04-30 10:39:12,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:12,744 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2025-04-30 10:39:12,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:12,744 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2025-04-30 10:39:12,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:39:12,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:12,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:12,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:39:12,745 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:12,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 379681450, now seen corresponding path program 1 times [2025-04-30 10:39:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:12,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011051972] [2025-04-30 10:39:12,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:39:12,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:39:12,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:39:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:12,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011051972] [2025-04-30 10:39:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011051972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:12,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097346362] [2025-04-30 10:39:12,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:12,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:12,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:39:12,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:39:12,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:39:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:39:12,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:39:12,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097346362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-30 10:39:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599179858] [2025-04-30 10:39:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:39:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:39:12,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:12,935 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:12,944 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-04-30 10:39:12,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:39:12,944 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-04-30 10:39:12,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:12,945 INFO L225 Difference]: With dead ends: 124 [2025-04-30 10:39:12,945 INFO L226 Difference]: Without dead ends: 124 [2025-04-30 10:39:12,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:12,945 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:12,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-04-30 10:39:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-04-30 10:39:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 119 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2025-04-30 10:39:12,948 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 41 [2025-04-30 10:39:12,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:12,948 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2025-04-30 10:39:12,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:12,948 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2025-04-30 10:39:12,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:12,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:12,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:12,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:13,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:13,150 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:13,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 30261783, now seen corresponding path program 1 times [2025-04-30 10:39:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:13,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345991200] [2025-04-30 10:39:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:13,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:13,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:13,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:13,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345991200] [2025-04-30 10:39:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345991200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:13,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182982422] [2025-04-30 10:39:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:13,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:39:13,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:13,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:39:13,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:13,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:13,632 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:39:13,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:39:13,664 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-30 10:39:13,682 INFO L325 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-04-30 10:39:13,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-04-30 10:39:13,776 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:39:13,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:39:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2025-04-30 10:39:13,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182982422] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:14,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2025-04-30 10:39:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775754043] [2025-04-30 10:39:14,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:14,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:39:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:14,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:39:14,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=373, Unknown=1, NotChecked=40, Total=506 [2025-04-30 10:39:14,167 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-30 10:39:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:14,552 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2025-04-30 10:39:14,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:14,553 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 43 [2025-04-30 10:39:14,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:14,553 INFO L225 Difference]: With dead ends: 134 [2025-04-30 10:39:14,553 INFO L226 Difference]: Without dead ends: 134 [2025-04-30 10:39:14,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=479, Unknown=1, NotChecked=46, Total=650 [2025-04-30 10:39:14,554 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:14,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 461 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 600 Invalid, 0 Unknown, 135 Unchecked, 0.3s Time] [2025-04-30 10:39:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-30 10:39:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2025-04-30 10:39:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 111 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-04-30 10:39:14,557 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 43 [2025-04-30 10:39:14,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:14,557 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-04-30 10:39:14,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 21 states have internal predecessors, (87), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-04-30 10:39:14,557 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-04-30 10:39:14,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:14,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:14,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:14,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:14,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:14,762 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:14,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 30261784, now seen corresponding path program 1 times [2025-04-30 10:39:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:14,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520169097] [2025-04-30 10:39:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:14,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:14,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:14,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:15,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520169097] [2025-04-30 10:39:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520169097] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:15,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748770187] [2025-04-30 10:39:15,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:15,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:15,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:39:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:15,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:39:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:15,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:15,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:15,338 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-04-30 10:39:15,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,366 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:39:15,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:15,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,429 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:39:15,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:15,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,516 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:39:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:15,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748770187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-04-30 10:39:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924367564] [2025-04-30 10:39:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:15,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:15,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:15,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-04-30 10:39:15,522 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:15,637 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2025-04-30 10:39:15,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:15,637 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-04-30 10:39:15,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:15,638 INFO L225 Difference]: With dead ends: 111 [2025-04-30 10:39:15,638 INFO L226 Difference]: Without dead ends: 111 [2025-04-30 10:39:15,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:39:15,638 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:15,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 259 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2025-04-30 10:39:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-30 10:39:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-04-30 10:39:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.6) internal successors, (112), 106 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2025-04-30 10:39:15,642 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 43 [2025-04-30 10:39:15,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:15,643 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2025-04-30 10:39:15,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:15,643 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2025-04-30 10:39:15,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:39:15,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:15,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:15,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:15,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:39:15,845 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:15,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash -983197224, now seen corresponding path program 1 times [2025-04-30 10:39:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:15,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999806081] [2025-04-30 10:39:15,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:15,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:39:15,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:39:15,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:15,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:39:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:15,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999806081] [2025-04-30 10:39:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999806081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:15,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892547882] [2025-04-30 10:39:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:15,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:15,918 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:16,024 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2025-04-30 10:39:16,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:16,025 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-04-30 10:39:16,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:16,025 INFO L225 Difference]: With dead ends: 107 [2025-04-30 10:39:16,025 INFO L226 Difference]: Without dead ends: 107 [2025-04-30 10:39:16,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:16,026 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:16,026 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 309 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-30 10:39:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-30 10:39:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.542857142857143) internal successors, (108), 102 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-04-30 10:39:16,028 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 45 [2025-04-30 10:39:16,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:16,028 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-04-30 10:39:16,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:16,028 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-04-30 10:39:16,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:39:16,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:16,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:16,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:39:16,029 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:16,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -983197223, now seen corresponding path program 1 times [2025-04-30 10:39:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:16,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686194002] [2025-04-30 10:39:16,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:16,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:39:16,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:39:16,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:16,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:16,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686194002] [2025-04-30 10:39:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686194002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:16,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620213762] [2025-04-30 10:39:16,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:16,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:16,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:39:16,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:39:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:39:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:16,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:39:16,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:39:16,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620213762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:16,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:16,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-04-30 10:39:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144203991] [2025-04-30 10:39:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:16,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:16,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:16,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:39:16,391 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:16,519 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2025-04-30 10:39:16,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:16,519 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-04-30 10:39:16,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:16,520 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:39:16,520 INFO L226 Difference]: Without dead ends: 103 [2025-04-30 10:39:16,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:39:16,520 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:16,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 409 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-30 10:39:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-30 10:39:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2025-04-30 10:39:16,525 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2025-04-30 10:39:16,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:16,526 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2025-04-30 10:39:16,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:16,526 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2025-04-30 10:39:16,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:39:16,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:16,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:16,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:39:16,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:39:16,727 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:16,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -414331933, now seen corresponding path program 1 times [2025-04-30 10:39:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:16,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786475748] [2025-04-30 10:39:16,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:16,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:16,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786475748] [2025-04-30 10:39:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786475748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:16,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189947545] [2025-04-30 10:39:16,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:16,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:16,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:39:17,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:17,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:17,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:17,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:39:17,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:17,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:17,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:17,238 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-30 10:39:17,270 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:39:17,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:39:17,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-30 10:39:17,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189947545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:17,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2025-04-30 10:39:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961341355] [2025-04-30 10:39:17,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:17,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:39:17,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:17,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:39:17,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=366, Unknown=1, NotChecked=38, Total=462 [2025-04-30 10:39:17,327 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:17,650 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2025-04-30 10:39:17,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:39:17,651 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2025-04-30 10:39:17,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:17,651 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:39:17,651 INFO L226 Difference]: Without dead ends: 102 [2025-04-30 10:39:17,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2025-04-30 10:39:17,652 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:17,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 644 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 676 Invalid, 0 Unknown, 102 Unchecked, 0.3s Time] [2025-04-30 10:39:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-30 10:39:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-04-30 10:39:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-04-30 10:39:17,655 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2025-04-30 10:39:17,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:17,655 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-04-30 10:39:17,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:17,655 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-04-30 10:39:17,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:39:17,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:17,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:17,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:17,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:39:17,856 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:17,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -414331932, now seen corresponding path program 1 times [2025-04-30 10:39:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:17,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28608891] [2025-04-30 10:39:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:17,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:17,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:17,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:18,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28608891] [2025-04-30 10:39:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28608891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:18,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716822590] [2025-04-30 10:39:18,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:18,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:18,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:18,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:18,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:39:18,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:18,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:18,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:18,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-30 10:39:18,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:18,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:18,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:18,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:18,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:18,564 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:39:18,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:18,597 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 18 treesize of output 13 [2025-04-30 10:39:18,603 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:39:18,603 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 15 treesize of output 15 [2025-04-30 10:39:18,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-30 10:39:18,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716822590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:18,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-04-30 10:39:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801552527] [2025-04-30 10:39:18,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:18,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:39:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:18,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:39:18,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=636, Unknown=1, NotChecked=50, Total=756 [2025-04-30 10:39:18,781 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 21 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:19,554 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2025-04-30 10:39:19,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:39:19,554 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 21 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2025-04-30 10:39:19,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:19,555 INFO L225 Difference]: With dead ends: 109 [2025-04-30 10:39:19,555 INFO L226 Difference]: Without dead ends: 109 [2025-04-30 10:39:19,556 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1271, Unknown=1, NotChecked=72, Total=1482 [2025-04-30 10:39:19,556 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 77 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:19,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1039 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1163 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2025-04-30 10:39:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-30 10:39:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-30 10:39:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 103 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2025-04-30 10:39:19,559 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 46 [2025-04-30 10:39:19,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:19,559 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2025-04-30 10:39:19,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 21 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:19,559 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2025-04-30 10:39:19,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:39:19,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:19,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:19,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:19,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:19,760 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:19,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1258971876, now seen corresponding path program 1 times [2025-04-30 10:39:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:19,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313642038] [2025-04-30 10:39:19,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:19,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:39:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:39:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:20,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:20,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313642038] [2025-04-30 10:39:20,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313642038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:20,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890646084] [2025-04-30 10:39:20,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:20,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:20,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:20,394 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:20,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:39:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:39:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:39:20,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:20,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:39:20,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:20,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:20,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:39:20,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2025-04-30 10:39:20,800 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:39:20,800 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 15 treesize of output 7 [2025-04-30 10:39:20,845 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:39:20,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:20,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-04-30 10:39:20,882 INFO L325 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-04-30 10:39:20,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2025-04-30 10:39:20,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-30 10:39:20,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-04-30 10:39:20,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:39:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-04-30 10:39:20,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890646084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:21,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2025-04-30 10:39:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717087837] [2025-04-30 10:39:21,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:21,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:39:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:21,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:39:21,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1166, Unknown=1, NotChecked=68, Total=1332 [2025-04-30 10:39:21,071 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 34 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:21,824 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2025-04-30 10:39:21,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:39:21,825 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2025-04-30 10:39:21,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:21,826 INFO L225 Difference]: With dead ends: 108 [2025-04-30 10:39:21,826 INFO L226 Difference]: Without dead ends: 108 [2025-04-30 10:39:21,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=2348, Unknown=1, NotChecked=98, Total=2652 [2025-04-30 10:39:21,826 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 72 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:21,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1137 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1252 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2025-04-30 10:39:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-30 10:39:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-04-30 10:39:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 102 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2025-04-30 10:39:21,832 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 48 [2025-04-30 10:39:21,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:21,832 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2025-04-30 10:39:21,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:21,832 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2025-04-30 10:39:21,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:39:21,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:21,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:21,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:39:22,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:22,033 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:22,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1258971877, now seen corresponding path program 1 times [2025-04-30 10:39:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067519621] [2025-04-30 10:39:22,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:39:22,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:39:22,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:23,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067519621] [2025-04-30 10:39:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067519621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:23,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009343835] [2025-04-30 10:39:23,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:23,170 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:23,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:39:23,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:39:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:39:23,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:23,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:23,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-04-30 10:39:23,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:23,517 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:23,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:23,738 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:23,739 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:39:23,742 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:39:23,955 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:39:23,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:24,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-04-30 10:39:24,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-30 10:39:24,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:39:24,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:24,313 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2025-04-30 10:39:24,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:24,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-04-30 10:39:24,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:24,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-30 10:39:24,353 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:39:24,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-30 10:39:24,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:39:24,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-04-30 10:39:24,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:39:24,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:39:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-30 10:39:24,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009343835] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:24,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2025-04-30 10:39:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660819827] [2025-04-30 10:39:24,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:24,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-30 10:39:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-30 10:39:24,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2608, Unknown=1, NotChecked=102, Total=2862 [2025-04-30 10:39:24,847 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 49 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 41 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:39:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:27,234 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2025-04-30 10:39:27,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:39:27,234 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 41 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-04-30 10:39:27,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:27,235 INFO L225 Difference]: With dead ends: 107 [2025-04-30 10:39:27,235 INFO L226 Difference]: Without dead ends: 107 [2025-04-30 10:39:27,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=317, Invalid=4941, Unknown=2, NotChecked=142, Total=5402 [2025-04-30 10:39:27,236 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:27,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1690 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2318 Invalid, 0 Unknown, 110 Unchecked, 1.2s Time] [2025-04-30 10:39:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-30 10:39:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-30 10:39:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2025-04-30 10:39:27,239 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 48 [2025-04-30 10:39:27,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:27,239 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2025-04-30 10:39:27,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 41 states have internal predecessors, (83), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:39:27,239 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2025-04-30 10:39:27,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:39:27,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:27,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:27,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:39:27,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:39:27,440 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:27,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 48005533, now seen corresponding path program 1 times [2025-04-30 10:39:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:27,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746687223] [2025-04-30 10:39:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:27,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:39:27,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:39:27,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:27,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:27,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746687223] [2025-04-30 10:39:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746687223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:27,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174231919] [2025-04-30 10:39:27,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:27,640 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:27,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:39:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:39:27,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:39:27,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:27,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:27,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:39:27,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:27,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:27,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:27,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:27,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:27,871 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-30 10:39:27,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:27,897 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:39:27,903 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:27,903 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:39:27,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:27,943 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-04-30 10:39:27,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:27,968 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:39:28,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:28,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:28,040 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:39:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2025-04-30 10:39:28,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174231919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:28,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-04-30 10:39:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837166737] [2025-04-30 10:39:28,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:28,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:39:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:28,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:39:28,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=233, Unknown=2, NotChecked=62, Total=342 [2025-04-30 10:39:28,158 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:28,175 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2025-04-30 10:39:28,177 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2025-04-30 10:39:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:28,382 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-04-30 10:39:28,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:39:28,385 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-04-30 10:39:28,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:28,386 INFO L225 Difference]: With dead ends: 101 [2025-04-30 10:39:28,386 INFO L226 Difference]: Without dead ends: 101 [2025-04-30 10:39:28,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=467, Unknown=4, NotChecked=188, Total=756 [2025-04-30 10:39:28,387 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 51 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:28,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 697 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 298 Unchecked, 0.1s Time] [2025-04-30 10:39:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-30 10:39:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-30 10:39:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-04-30 10:39:28,389 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 49 [2025-04-30 10:39:28,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:28,389 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-04-30 10:39:28,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:28,390 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-04-30 10:39:28,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:39:28,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:28,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:28,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:39:28,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:28,590 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:28,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -681138067, now seen corresponding path program 1 times [2025-04-30 10:39:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:28,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125263711] [2025-04-30 10:39:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:28,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:39:28,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:39:28,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:28,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:28,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125263711] [2025-04-30 10:39:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125263711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:39:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508851512] [2025-04-30 10:39:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:28,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:39:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:28,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:39:28,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:28,658 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:28,717 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-04-30 10:39:28,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:39:28,717 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-04-30 10:39:28,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:28,718 INFO L225 Difference]: With dead ends: 100 [2025-04-30 10:39:28,718 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:39:28,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:28,718 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:28,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:39:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-30 10:39:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.337837837837838) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-04-30 10:39:28,720 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 54 [2025-04-30 10:39:28,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:28,722 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-04-30 10:39:28,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:28,722 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-04-30 10:39:28,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:39:28,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:28,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:28,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:39:28,723 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:28,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash -681138066, now seen corresponding path program 1 times [2025-04-30 10:39:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:28,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153441670] [2025-04-30 10:39:28,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:28,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:39:28,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:39:28,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:28,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:28,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153441670] [2025-04-30 10:39:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153441670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:28,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874508729] [2025-04-30 10:39:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:28,952 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:39:29,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:39:29,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:39:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:29,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:39:29,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:29,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-04-30 10:39:29,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-04-30 10:39:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:29,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874508729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:29,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:29,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2025-04-30 10:39:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950306448] [2025-04-30 10:39:29,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:29,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:39:29,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:29,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:39:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:39:29,208 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:29,272 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-04-30 10:39:29,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:39:29,272 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-04-30 10:39:29,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:29,273 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:39:29,273 INFO L226 Difference]: Without dead ends: 99 [2025-04-30 10:39:29,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:39:29,273 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:29,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-30 10:39:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-30 10:39:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-04-30 10:39:29,275 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 54 [2025-04-30 10:39:29,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:29,276 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-04-30 10:39:29,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:39:29,276 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-04-30 10:39:29,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:39:29,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:29,276 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:29,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:39:29,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:29,481 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:29,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1130077226, now seen corresponding path program 1 times [2025-04-30 10:39:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:29,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737088211] [2025-04-30 10:39:29,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:29,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:29,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:29,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737088211] [2025-04-30 10:39:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737088211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:39:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496031114] [2025-04-30 10:39:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:29,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:39:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:39:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:39:29,623 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:29,725 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-04-30 10:39:29,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:39:29,725 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-04-30 10:39:29,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:29,725 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:39:29,726 INFO L226 Difference]: Without dead ends: 103 [2025-04-30 10:39:29,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:39:29,726 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:29,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 392 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-30 10:39:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-04-30 10:39:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.32) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-04-30 10:39:29,728 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 59 [2025-04-30 10:39:29,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:29,728 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-04-30 10:39:29,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:29,728 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-04-30 10:39:29,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:39:29,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:29,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:29,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:39:29,728 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:29,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1130077227, now seen corresponding path program 1 times [2025-04-30 10:39:29,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:29,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486363819] [2025-04-30 10:39:29,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:29,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:30,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486363819] [2025-04-30 10:39:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486363819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:30,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7896157] [2025-04-30 10:39:30,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:30,255 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:30,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:39:30,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:30,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:30,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:30,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:39:30,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:30,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:30,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:30,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:30,768 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|))) (and (<= .cse0 0) (<= 0 (+ .cse0 4))))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:39:30,810 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:39:30,810 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 15 treesize of output 15 [2025-04-30 10:39:30,815 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 18 treesize of output 13 [2025-04-30 10:39:30,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:30,986 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:30,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 32 [2025-04-30 10:39:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-30 10:39:31,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7896157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:31,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2025-04-30 10:39:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521886111] [2025-04-30 10:39:31,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:31,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:39:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:31,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:39:31,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1148, Unknown=1, NotChecked=68, Total=1332 [2025-04-30 10:39:31,227 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 33 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:39:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:31,835 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-04-30 10:39:31,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:39:31,836 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2025-04-30 10:39:31,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:31,836 INFO L225 Difference]: With dead ends: 105 [2025-04-30 10:39:31,836 INFO L226 Difference]: Without dead ends: 105 [2025-04-30 10:39:31,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1715, Unknown=1, NotChecked=84, Total=1980 [2025-04-30 10:39:31,837 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 89 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:31,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 832 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 989 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2025-04-30 10:39:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-30 10:39:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-04-30 10:39:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 95 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-04-30 10:39:31,839 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 59 [2025-04-30 10:39:31,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:31,839 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-04-30 10:39:31,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 29 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:39:31,839 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-04-30 10:39:31,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-30 10:39:31,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:31,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:31,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:39:32,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:39:32,040 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:32,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1231217869, now seen corresponding path program 1 times [2025-04-30 10:39:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:32,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991565529] [2025-04-30 10:39:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:32,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:39:32,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:39:32,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:33,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991565529] [2025-04-30 10:39:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991565529] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:33,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070445681] [2025-04-30 10:39:33,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:33,906 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:33,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:39:34,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:39:34,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:39:34,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:34,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-04-30 10:39:34,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:34,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:34,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:34,739 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:34,739 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:39:34,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:39:34,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:34,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:34,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:39:34,989 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:39:35,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:39:35,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:35,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-30 10:39:35,429 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:39:35,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-30 10:39:35,441 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:39:35,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2025-04-30 10:39:35,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:39:35,456 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:39:35,456 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 15 treesize of output 15 [2025-04-30 10:39:35,722 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:35,722 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:35,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2025-04-30 10:39:35,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:39:35,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:39:35,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:39:36,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-30 10:39:36,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:39:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:36,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:40,760 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 Int) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3377) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3379)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_3381))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2025-04-30 10:39:40,766 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 Int) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_3377) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3379)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_3381))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-04-30 10:39:41,197 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 Int) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_3377) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3379))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3381)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2025-04-30 10:39:41,215 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 Int) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3379 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_3377) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_3379))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3381)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2025-04-30 10:39:41,270 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3381 Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| Int) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3379 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_3390) .cse1) .cse2) v_ArrVal_3377) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_3379))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3381)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-04-30 10:39:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070445681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:41,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 66 [2025-04-30 10:39:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13417572] [2025-04-30 10:39:41,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:41,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-30 10:39:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:41,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-30 10:39:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=4894, Unknown=56, NotChecked=730, Total=6006 [2025-04-30 10:39:41,275 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 66 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 57 states have internal predecessors, (107), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:39:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:43,344 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2025-04-30 10:39:43,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:39:43,344 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 57 states have internal predecessors, (107), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2025-04-30 10:39:43,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:43,345 INFO L225 Difference]: With dead ends: 105 [2025-04-30 10:39:43,345 INFO L226 Difference]: Without dead ends: 105 [2025-04-30 10:39:43,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=526, Invalid=8179, Unknown=57, NotChecked=940, Total=9702 [2025-04-30 10:39:43,347 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 81 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:43,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2086 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-30 10:39:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-30 10:39:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-04-30 10:39:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-04-30 10:39:43,349 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 63 [2025-04-30 10:39:43,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:43,349 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-04-30 10:39:43,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 57 states have internal predecessors, (107), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:39:43,349 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-04-30 10:39:43,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:39:43,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:43,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:43,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:39:43,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:39:43,550 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:43,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 486642079, now seen corresponding path program 1 times [2025-04-30 10:39:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:43,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809063620] [2025-04-30 10:39:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:43,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:39:43,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:39:43,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:43,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809063620] [2025-04-30 10:39:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809063620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194530531] [2025-04-30 10:39:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:43,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:43,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:43,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:43,698 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:43,795 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-04-30 10:39:43,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:43,796 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-04-30 10:39:43,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:43,797 INFO L225 Difference]: With dead ends: 100 [2025-04-30 10:39:43,797 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:39:43,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:39:43,798 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:43,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 285 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:39:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-30 10:39:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-04-30 10:39:43,803 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 64 [2025-04-30 10:39:43,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:43,803 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-04-30 10:39:43,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:43,803 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-04-30 10:39:43,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:39:43,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:43,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:43,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:39:43,804 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:43,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 486642080, now seen corresponding path program 1 times [2025-04-30 10:39:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:43,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629583089] [2025-04-30 10:39:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:43,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:39:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:39:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:44,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629583089] [2025-04-30 10:39:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629583089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:44,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121234913] [2025-04-30 10:39:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:44,141 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:39:44,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:39:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:39:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:44,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:39:44,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:44,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-04-30 10:39:44,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-04-30 10:39:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:39:44,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121234913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2025-04-30 10:39:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707723161] [2025-04-30 10:39:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:44,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:39:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:44,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:39:44,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:39:44,615 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:44,775 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-04-30 10:39:44,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:39:44,775 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-04-30 10:39:44,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:44,776 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:39:44,776 INFO L226 Difference]: Without dead ends: 99 [2025-04-30 10:39:44,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:39:44,776 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 49 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:44,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 465 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-30 10:39:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-30 10:39:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-04-30 10:39:44,778 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 64 [2025-04-30 10:39:44,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:44,778 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-04-30 10:39:44,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:44,779 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-04-30 10:39:44,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:39:44,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:44,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:39:44,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:39:44,980 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:44,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -488394716, now seen corresponding path program 1 times [2025-04-30 10:39:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:44,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471308259] [2025-04-30 10:39:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:44,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:39:45,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:39:45,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:45,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:46,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:46,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471308259] [2025-04-30 10:39:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471308259] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:46,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964301916] [2025-04-30 10:39:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:46,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:46,802 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:39:46,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:39:47,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:39:47,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:47,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:47,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-30 10:39:47,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:47,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:47,162 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:47,162 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:39:47,220 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 11 treesize of output 7 [2025-04-30 10:39:47,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:47,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:47,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-04-30 10:39:47,564 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:47,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67 treesize of output 17 [2025-04-30 10:39:47,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:39:47,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:47,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 52 [2025-04-30 10:39:47,693 INFO L325 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2025-04-30 10:39:47,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2025-04-30 10:39:47,879 INFO L325 Elim1Store]: treesize reduction 68, result has 49.6 percent of original size [2025-04-30 10:39:47,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 94 [2025-04-30 10:39:48,018 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-30 10:39:48,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 142 [2025-04-30 10:39:48,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:48,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 127 [2025-04-30 10:39:48,377 INFO L325 Elim1Store]: treesize reduction 96, result has 43.9 percent of original size [2025-04-30 10:39:48,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 162 [2025-04-30 10:39:50,683 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:50,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 679 treesize of output 711 [2025-04-30 10:39:50,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 350 [2025-04-30 10:39:51,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:51,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 224 treesize of output 128 [2025-04-30 10:39:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:51,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964301916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:52,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 60 [2025-04-30 10:39:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636566906] [2025-04-30 10:39:52,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:52,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-30 10:39:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:53,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-30 10:39:53,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=5301, Unknown=34, NotChecked=0, Total=5700 [2025-04-30 10:39:53,003 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 61 states, 58 states have (on average 1.9310344827586208) internal successors, (112), 54 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:39:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:56,185 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2025-04-30 10:39:56,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:39:56,185 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.9310344827586208) internal successors, (112), 54 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 66 [2025-04-30 10:39:56,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:56,186 INFO L225 Difference]: With dead ends: 115 [2025-04-30 10:39:56,186 INFO L226 Difference]: Without dead ends: 115 [2025-04-30 10:39:56,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=641, Invalid=8443, Unknown=36, NotChecked=0, Total=9120 [2025-04-30 10:39:56,189 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:56,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1503 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-30 10:39:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-30 10:39:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-04-30 10:39:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-04-30 10:39:56,208 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 66 [2025-04-30 10:39:56,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:56,213 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-04-30 10:39:56,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.9310344827586208) internal successors, (112), 54 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:39:56,213 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-04-30 10:39:56,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:39:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:56,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:56,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:39:56,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:56,415 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2025-04-30 10:39:56,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -488394715, now seen corresponding path program 1 times [2025-04-30 10:39:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:56,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491152510] [2025-04-30 10:39:56,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:39:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:39:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:40:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:40:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:40:00,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491152510] [2025-04-30 10:40:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491152510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:40:00,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47337801] [2025-04-30 10:40:00,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:40:00,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:40:00,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:40:00,845 INFO L229 MonitoredProcess]: Starting monitored process 21 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:40:00,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:40:01,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:40:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:40:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:40:01,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:40:01,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-04-30 10:40:01,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:40:01,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:40:01,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:40:01,299 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:40:01,300 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:40:01,304 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:40:01,414 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 11 treesize of output 7 [2025-04-30 10:40:01,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:40:01,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:40:01,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:40:01,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-04-30 10:40:01,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2025-04-30 10:40:01,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:40:01,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:40:01,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 Killed by 15