./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66688d15edd326007f633248cef0d3bb8a45393c20af38da2d40576d7b2626d4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:05,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:05,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:19:05,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:05,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:05,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:05,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:05,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:05,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:05,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:05,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:05,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:05,646 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:05,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:05,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:05,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:05,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:05,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:05,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:05,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:05,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:05,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:05,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:05,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:05,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:05,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:05,653 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 -> 66688d15edd326007f633248cef0d3bb8a45393c20af38da2d40576d7b2626d4 [2025-04-29 11:19:05,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:05,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:05,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:05,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:05,898 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:05,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.c [2025-04-29 11:19:07,219 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e980c1cd/f48be1613ff14dd08c487db4f391b376/FLAG9b46db7a9 [2025-04-29 11:19:07,432 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:07,433 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.c [2025-04-29 11:19:07,434 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:07,434 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:07,469 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e980c1cd/f48be1613ff14dd08c487db4f391b376/FLAG9b46db7a9 [2025-04-29 11:19:08,268 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e980c1cd/f48be1613ff14dd08c487db4f391b376 [2025-04-29 11:19:08,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:08,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:08,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:08,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:08,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:08,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8430663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08, skipping insertion in model container [2025-04-29 11:19:08,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:08,441 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:08,448 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:08,481 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:08,492 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:08,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08 WrapperNode [2025-04-29 11:19:08,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:08,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:08,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:08,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:08,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,526 INFO L138 Inliner]: procedures = 18, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2025-04-29 11:19:08,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:08,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:08,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:08,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:08,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,556 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [9, 20]. 69 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 14 writes are split as follows [1, 13]. [2025-04-29 11:19:08,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:08,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:08,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:08,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:08,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:08,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:19:08,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:19:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:19:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:08,678 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:08,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:08,982 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:08,983 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:08,991 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:08,991 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:19:08,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:08 BoogieIcfgContainer [2025-04-29 11:19:08,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:08,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:08,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:08,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:08" (1/3) ... [2025-04-29 11:19:08,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b42b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:08, skipping insertion in model container [2025-04-29 11:19:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08" (2/3) ... [2025-04-29 11:19:08,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b42b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:08, skipping insertion in model container [2025-04-29 11:19:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:08" (3/3) ... [2025-04-29 11:19:09,000 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.c [2025-04-29 11:19:09,012 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:09,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.c that has 2 procedures, 138 locations, 153 edges, 1 initial locations, 3 loop locations, and 63 error locations. [2025-04-29 11:19:09,057 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:09,067 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;@3abed9eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:09,068 INFO L341 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-04-29 11:19:09,071 INFO L278 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.057142857142857) internal successors, (144), 133 states have internal predecessors, (144), 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-29 11:19:09,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:09,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:09,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:09,076 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:09,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2025-04-29 11:19:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673831243] [2025-04-29 11:19:09,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:09,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:09,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:09,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673831243] [2025-04-29 11:19:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673831243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:09,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:09,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793282260] [2025-04-29 11:19:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:09,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:09,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:09,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:09,284 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.057142857142857) internal successors, (144), 133 states have internal predecessors, (144), 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-29 11:19:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:09,418 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-04-29 11:19:09,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:09,420 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-29 11:19:09,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:09,426 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:19:09,426 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:19:09,429 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-29 11:19:09,431 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:09,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 210 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:19:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-04-29 11:19:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 125 states have internal predecessors, (131), 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-29 11:19:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2025-04-29 11:19:09,489 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 6 [2025-04-29 11:19:09,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:09,490 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2025-04-29 11:19:09,490 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-29 11:19:09,490 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2025-04-29 11:19:09,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:09,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:09,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:09,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:09,491 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:09,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2025-04-29 11:19:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193466159] [2025-04-29 11:19:09,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:09,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:09,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193466159] [2025-04-29 11:19:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193466159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649730087] [2025-04-29 11:19:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:09,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:09,588 INFO L87 Difference]: Start difference. First operand 130 states and 137 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-29 11:19:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:09,679 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2025-04-29 11:19:09,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:09,681 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-29 11:19:09,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:09,682 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:19:09,682 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 11:19:09,682 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-29 11:19:09,682 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:09,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 11:19:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-04-29 11:19:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 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-29 11:19:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2025-04-29 11:19:09,690 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 6 [2025-04-29 11:19:09,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:09,690 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2025-04-29 11:19:09,690 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-29 11:19:09,690 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2025-04-29 11:19:09,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:09,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:09,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:09,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:09,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:09,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1787865239, now seen corresponding path program 1 times [2025-04-29 11:19:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649776267] [2025-04-29 11:19:09,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:09,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:09,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:09,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649776267] [2025-04-29 11:19:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649776267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:09,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:09,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304289213] [2025-04-29 11:19:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:09,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:09,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:09,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:09,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:09,758 INFO L87 Difference]: Start difference. First operand 127 states and 134 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-29 11:19:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:09,777 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2025-04-29 11:19:09,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:09,778 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-29 11:19:09,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:09,779 INFO L225 Difference]: With dead ends: 138 [2025-04-29 11:19:09,780 INFO L226 Difference]: Without dead ends: 138 [2025-04-29 11:19:09,780 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-29 11:19:09,781 INFO L437 NwaCegarLoop]: 132 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 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-29 11:19:09,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-29 11:19:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2025-04-29 11:19:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 123 states have internal predecessors, (129), 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-29 11:19:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2025-04-29 11:19:09,792 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 14 [2025-04-29 11:19:09,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:09,792 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2025-04-29 11:19:09,792 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-29 11:19:09,792 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2025-04-29 11:19:09,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:09,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:09,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:09,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:09,793 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:09,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1927548027, now seen corresponding path program 1 times [2025-04-29 11:19:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975973007] [2025-04-29 11:19:09,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:09,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,942 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-29 11:19:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975973007] [2025-04-29 11:19:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975973007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128047212] [2025-04-29 11:19:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:09,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:09,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:09,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:09,944 INFO L87 Difference]: Start difference. First operand 128 states and 135 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-29 11:19:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,110 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2025-04-29 11:19:10,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:10,110 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-29 11:19:10,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,111 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:19:10,111 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 11:19:10,111 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-29 11:19:10,112 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 372 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-29 11:19:10,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 372 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 11:19:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-04-29 11:19:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 122 states have internal predecessors, (128), 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-29 11:19:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2025-04-29 11:19:10,119 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 24 [2025-04-29 11:19:10,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,119 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2025-04-29 11:19:10,120 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-29 11:19:10,120 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2025-04-29 11:19:10,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:10,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:10,120 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:10,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1927548026, now seen corresponding path program 1 times [2025-04-29 11:19:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936871602] [2025-04-29 11:19:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:10,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:10,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,307 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-29 11:19:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:10,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936871602] [2025-04-29 11:19:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936871602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386019935] [2025-04-29 11:19:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:10,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:10,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:10,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:10,310 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-29 11:19:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,454 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2025-04-29 11:19:10,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:10,455 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-29 11:19:10,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,456 INFO L225 Difference]: With dead ends: 126 [2025-04-29 11:19:10,456 INFO L226 Difference]: Without dead ends: 126 [2025-04-29 11:19:10,456 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-29 11:19:10,457 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:10,458 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 400 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-29 11:19:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-29 11:19:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 121 states have internal predecessors, (127), 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-29 11:19:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2025-04-29 11:19:10,470 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 24 [2025-04-29 11:19:10,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,470 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2025-04-29 11:19:10,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-29 11:19:10,470 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2025-04-29 11:19:10,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:10,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,471 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-29 11:19:10,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:19:10,471 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:10,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1242749818, now seen corresponding path program 1 times [2025-04-29 11:19:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865717929] [2025-04-29 11:19:10,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:10,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,691 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-29 11:19:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:10,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865717929] [2025-04-29 11:19:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865717929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:10,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706409240] [2025-04-29 11:19:10,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:10,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:10,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:19:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:10,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:10,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:19:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:10,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:10,899 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:10,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:19:10,952 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-29 11:19:10,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:11,231 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-29 11:19:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706409240] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:11,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-04-29 11:19:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116083957] [2025-04-29 11:19:11,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:11,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:19:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:19:11,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:19:11,232 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:11,557 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2025-04-29 11:19:11,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:11,558 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-04-29 11:19:11,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:11,559 INFO L225 Difference]: With dead ends: 131 [2025-04-29 11:19:11,559 INFO L226 Difference]: Without dead ends: 131 [2025-04-29 11:19:11,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:19:11,559 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:11,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 580 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:19:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-29 11:19:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-29 11:19:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 125 states have internal predecessors, (133), 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-29 11:19:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2025-04-29 11:19:11,564 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 26 [2025-04-29 11:19:11,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:11,564 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2025-04-29 11:19:11,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:11,564 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2025-04-29 11:19:11,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:11,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:11,565 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-29 11:19:11,572 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-29 11:19:11,769 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-29 11:19:11,769 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:11,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1242749817, now seen corresponding path program 1 times [2025-04-29 11:19:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:11,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602548060] [2025-04-29 11:19:11,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:11,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:11,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:11,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:11,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:12,213 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-29 11:19:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:12,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602548060] [2025-04-29 11:19:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602548060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:12,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637844621] [2025-04-29 11:19:12,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:12,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:12,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:19:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:12,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:12,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:12,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:19:12,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:12,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:12,307 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-29 11:19:12,419 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:12,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:19:12,433 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:12,433 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-29 11:19:12,466 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-29 11:19:12,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637844621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:12,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-04-29 11:19:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393188373] [2025-04-29 11:19:12,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:12,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:19:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:12,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:19:12,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:12,566 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:12,945 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-04-29 11:19:12,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:19:12,945 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-04-29 11:19:12,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:12,946 INFO L225 Difference]: With dead ends: 131 [2025-04-29 11:19:12,946 INFO L226 Difference]: Without dead ends: 131 [2025-04-29 11:19:12,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:19:12,946 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:12,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:19:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-29 11:19:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-29 11:19:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 125 states have internal predecessors, (132), 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-29 11:19:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-04-29 11:19:12,954 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 26 [2025-04-29 11:19:12,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:12,954 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-04-29 11:19:12,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:12,955 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-04-29 11:19:12,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:19:12,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:12,955 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-29 11:19:12,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:13,159 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-29 11:19:13,159 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:13,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash -281512248, now seen corresponding path program 1 times [2025-04-29 11:19:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:13,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700683065] [2025-04-29 11:19:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:13,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:13,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:13,223 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-29 11:19:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:13,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700683065] [2025-04-29 11:19:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700683065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:13,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588916771] [2025-04-29 11:19:13,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:13,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:13,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:13,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:19:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:13,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:19:13,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:13,325 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-29 11:19:13,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:13,352 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-29 11:19:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588916771] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:13,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 11:19:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973616531] [2025-04-29 11:19:13,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:13,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:13,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:13,355 INFO L87 Difference]: Start difference. First operand 131 states and 140 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-29 11:19:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:13,393 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2025-04-29 11:19:13,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:13,393 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-29 11:19:13,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:13,394 INFO L225 Difference]: With dead ends: 131 [2025-04-29 11:19:13,394 INFO L226 Difference]: Without dead ends: 131 [2025-04-29 11:19:13,394 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-29 11:19:13,394 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 599 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-29 11:19:13,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 599 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-29 11:19:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-29 11:19:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 125 states have internal predecessors, (131), 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-29 11:19:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2025-04-29 11:19:13,400 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 28 [2025-04-29 11:19:13,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:13,401 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2025-04-29 11:19:13,401 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-29 11:19:13,401 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2025-04-29 11:19:13,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:13,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:13,402 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-29 11:19:13,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:19:13,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:13,603 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:13,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -141743404, now seen corresponding path program 1 times [2025-04-29 11:19:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:13,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163590003] [2025-04-29 11:19:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:13,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:13,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:13,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:13,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:13,669 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-29 11:19:13,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:13,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163590003] [2025-04-29 11:19:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163590003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:13,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482862475] [2025-04-29 11:19:13,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:13,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:13,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:19:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:13,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:13,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:13,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:13,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:19:13,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:13,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:13,799 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-29 11:19:13,837 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:13,839 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-29 11:19:13,850 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-29 11:19:13,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482862475] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:13,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-29 11:19:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396035836] [2025-04-29 11:19:13,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:13,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:19:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:19:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-29 11:19:13,891 INFO L87 Difference]: Start difference. First operand 131 states and 139 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-29 11:19:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:14,133 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2025-04-29 11:19:14,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:14,133 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-29 11:19:14,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:14,134 INFO L225 Difference]: With dead ends: 130 [2025-04-29 11:19:14,134 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:19:14,134 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-29 11:19:14,134 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 9 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:14,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 577 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 131 Unchecked, 0.2s Time] [2025-04-29 11:19:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:19:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-04-29 11:19:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 124 states have internal predecessors, (130), 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-29 11:19:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2025-04-29 11:19:14,137 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2025-04-29 11:19:14,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:14,137 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2025-04-29 11:19:14,137 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-29 11:19:14,137 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2025-04-29 11:19:14,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:14,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:14,138 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-29 11:19:14,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:19:14,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:14,339 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:14,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -141743403, now seen corresponding path program 1 times [2025-04-29 11:19:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:14,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805451569] [2025-04-29 11:19:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:14,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:14,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,459 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-29 11:19:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:14,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805451569] [2025-04-29 11:19:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805451569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:14,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236521035] [2025-04-29 11:19:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:14,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:14,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:19:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:14,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:14,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:14,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:19:14,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:14,552 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-29 11:19:14,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:14,667 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-29 11:19:14,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:14,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:14,702 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:14,702 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-29 11:19:14,732 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-29 11:19:14,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236521035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:14,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-29 11:19:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656506527] [2025-04-29 11:19:14,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:14,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:14,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:14,840 INFO L87 Difference]: Start difference. First operand 130 states and 138 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-29 11:19:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:15,256 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2025-04-29 11:19:15,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:19:15,257 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-29 11:19:15,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:15,258 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:19:15,258 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:19:15,258 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-29 11:19:15,259 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 12 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:15,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 955 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 724 Invalid, 0 Unknown, 153 Unchecked, 0.3s Time] [2025-04-29 11:19:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:19:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2025-04-29 11:19:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 80 states have (on average 1.8) internal successors, (144), 133 states have internal predecessors, (144), 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-29 11:19:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2025-04-29 11:19:15,262 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 29 [2025-04-29 11:19:15,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:15,262 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2025-04-29 11:19:15,262 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-29 11:19:15,262 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2025-04-29 11:19:15,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:15,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:15,262 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-29 11:19:15,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:15,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:19:15,463 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:15,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -99078229, now seen corresponding path program 1 times [2025-04-29 11:19:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:15,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056771937] [2025-04-29 11:19:15,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:15,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:15,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:15,532 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-29 11:19:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:15,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056771937] [2025-04-29 11:19:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056771937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:15,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:15,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:15,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356733189] [2025-04-29 11:19:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:15,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:15,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:15,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:15,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:15,533 INFO L87 Difference]: Start difference. First operand 140 states and 154 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-29 11:19:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:15,698 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2025-04-29 11:19:15,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:15,699 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-29 11:19:15,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:15,699 INFO L225 Difference]: With dead ends: 139 [2025-04-29 11:19:15,699 INFO L226 Difference]: Without dead ends: 139 [2025-04-29 11:19:15,700 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-29 11:19:15,700 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 420 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.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:15,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 420 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-29 11:19:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-04-29 11:19:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.7875) internal successors, (143), 132 states have internal predecessors, (143), 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-29 11:19:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-04-29 11:19:15,703 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 30 [2025-04-29 11:19:15,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:15,703 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-04-29 11:19:15,703 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-29 11:19:15,703 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-04-29 11:19:15,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:15,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:15,703 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-29 11:19:15,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:19:15,703 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:15,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -99078228, now seen corresponding path program 1 times [2025-04-29 11:19:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:15,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085391501] [2025-04-29 11:19:15,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:15,844 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-29 11:19:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:15,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085391501] [2025-04-29 11:19:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085391501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495447441] [2025-04-29 11:19:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:15,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:15,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:15,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:15,846 INFO L87 Difference]: Start difference. First operand 139 states and 153 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-29 11:19:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:16,019 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-04-29 11:19:16,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:16,019 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-29 11:19:16,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:16,020 INFO L225 Difference]: With dead ends: 138 [2025-04-29 11:19:16,020 INFO L226 Difference]: Without dead ends: 138 [2025-04-29 11:19:16,020 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-29 11:19:16,020 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:16,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 450 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-29 11:19:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-04-29 11:19:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.775) internal successors, (142), 131 states have internal predecessors, (142), 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-29 11:19:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-04-29 11:19:16,023 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 30 [2025-04-29 11:19:16,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:16,023 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-04-29 11:19:16,023 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-29 11:19:16,023 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-04-29 11:19:16,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:16,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:16,024 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-29 11:19:16,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:19:16,024 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:16,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 124728131, now seen corresponding path program 1 times [2025-04-29 11:19:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:16,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923434678] [2025-04-29 11:19:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:16,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:16,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:16,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,091 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-29 11:19:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:16,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923434678] [2025-04-29 11:19:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923434678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:16,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330733728] [2025-04-29 11:19:16,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:16,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:16,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:16,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:19:16,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:16,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:16,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:16,214 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-29 11:19:16,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330733728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:19:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384972495] [2025-04-29 11:19:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:16,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:16,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:16,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:16,217 INFO L87 Difference]: Start difference. First operand 138 states and 152 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-29 11:19:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:16,225 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2025-04-29 11:19:16,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:16,225 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-29 11:19:16,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:16,226 INFO L225 Difference]: With dead ends: 120 [2025-04-29 11:19:16,226 INFO L226 Difference]: Without dead ends: 120 [2025-04-29 11:19:16,226 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-29 11:19:16,226 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 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-29 11:19:16,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-29 11:19:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-29 11:19:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 115 states have internal predecessors, (119), 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-29 11:19:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2025-04-29 11:19:16,229 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 41 [2025-04-29 11:19:16,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:16,229 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2025-04-29 11:19:16,229 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-29 11:19:16,229 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2025-04-29 11:19:16,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:16,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:16,231 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-29 11:19:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:16,435 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-29 11:19:16,435 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:16,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1194917104, now seen corresponding path program 1 times [2025-04-29 11:19:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:16,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344683608] [2025-04-29 11:19:16,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:16,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:16,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:16,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,780 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-29 11:19:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:16,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344683608] [2025-04-29 11:19:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344683608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:16,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991842328] [2025-04-29 11:19:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:16,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:16,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:19:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:16,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:16,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:19:16,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:16,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:16,960 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:16,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:19:17,008 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-29 11:19:17,024 INFO L325 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-04-29 11:19:17,024 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-29 11:19:17,137 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:19:17,137 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-29 11:19:17,147 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-29 11:19:17,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:17,568 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-29 11:19:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991842328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:17,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 23 [2025-04-29 11:19:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347368214] [2025-04-29 11:19:17,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:19:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:19:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=410, Unknown=1, NotChecked=42, Total=552 [2025-04-29 11:19:17,569 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 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-29 11:19:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:17,975 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2025-04-29 11:19:17,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:17,975 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 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-29 11:19:17,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:17,976 INFO L225 Difference]: With dead ends: 130 [2025-04-29 11:19:17,976 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:19:17,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=565, Unknown=1, NotChecked=50, Total=756 [2025-04-29 11:19:17,977 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 371 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:17,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 475 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 668 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2025-04-29 11:19:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:19:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2025-04-29 11:19:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 107 states have internal predecessors, (111), 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-29 11:19:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2025-04-29 11:19:17,979 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 43 [2025-04-29 11:19:17,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:17,979 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2025-04-29 11:19:17,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 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-29 11:19:17,979 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2025-04-29 11:19:17,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:17,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,980 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-29 11:19:17,986 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-29 11:19:18,184 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-29 11:19:18,184 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:18,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1194917105, now seen corresponding path program 1 times [2025-04-29 11:19:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:18,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391427675] [2025-04-29 11:19:18,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:18,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:18,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:18,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:18,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391427675] [2025-04-29 11:19:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391427675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:18,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700569441] [2025-04-29 11:19:18,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:18,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:18,578 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:18,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:19:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:18,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:18,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:18,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:19:18,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:18,709 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-29 11:19:18,717 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-29 11:19:18,723 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-29 11:19:18,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:18,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:18,771 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-29 11:19:18,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:18,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:18,846 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-29 11:19:18,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:18,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:18,885 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-29 11:19:18,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700569441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:18,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2025-04-29 11:19:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639000990] [2025-04-29 11:19:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:18,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:18,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:18,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:19:18,886 INFO L87 Difference]: Start difference. First operand 112 states and 117 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-29 11:19:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:19,000 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2025-04-29 11:19:19,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:19,000 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-29 11:19:19,000 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:19,001 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:19:19,001 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:19:19,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:19:19,002 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:19,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 237 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2025-04-29 11:19:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:19:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-29 11:19:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 102 states have internal predecessors, (106), 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-29 11:19:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2025-04-29 11:19:19,006 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 43 [2025-04-29 11:19:19,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:19,007 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2025-04-29 11:19:19,007 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-29 11:19:19,007 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2025-04-29 11:19:19,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:19,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:19,008 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-29 11:19:19,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:19:19,208 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-29 11:19:19,209 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:19,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1559069297, now seen corresponding path program 1 times [2025-04-29 11:19:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:19,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679671107] [2025-04-29 11:19:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:19,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:19,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:19,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,284 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-29 11:19:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:19,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679671107] [2025-04-29 11:19:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679671107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492458161] [2025-04-29 11:19:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:19,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:19,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:19,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:19,286 INFO L87 Difference]: Start difference. First operand 107 states and 112 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-29 11:19:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:19,428 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-04-29 11:19:19,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:19,429 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-29 11:19:19,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:19,430 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:19:19,430 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:19:19,430 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-29 11:19:19,430 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 279 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-29 11:19:19,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 279 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:19:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-29 11:19:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 98 states have internal predecessors, (102), 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-29 11:19:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2025-04-29 11:19:19,432 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 45 [2025-04-29 11:19:19,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:19,433 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2025-04-29 11:19:19,433 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-29 11:19:19,433 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2025-04-29 11:19:19,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:19,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:19,434 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-29 11:19:19,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:19:19,435 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:19,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1559069298, now seen corresponding path program 1 times [2025-04-29 11:19:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:19,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041193319] [2025-04-29 11:19:19,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:19,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:19,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:19,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,607 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-29 11:19:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:19,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041193319] [2025-04-29 11:19:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041193319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:19,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367264500] [2025-04-29 11:19:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:19,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:19,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:19:19,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:19,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:19,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:19:19,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:19,825 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-29 11:19:19,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367264500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-04-29 11:19:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530809172] [2025-04-29 11:19:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:19,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:19,826 INFO L87 Difference]: Start difference. First operand 103 states and 108 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-29 11:19:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:19,930 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-04-29 11:19:19,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:19,930 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-29 11:19:19,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:19,931 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:19,931 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:19,931 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-29 11:19:19,931 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 21 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:19,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 321 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 94 states have internal predecessors, (98), 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-29 11:19:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-04-29 11:19:19,933 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 45 [2025-04-29 11:19:19,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:19,934 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-04-29 11:19:19,934 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-29 11:19:19,935 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-04-29 11:19:19,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:19,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:19,935 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-29 11:19:19,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:20,135 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-29 11:19:20,136 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:20,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1086518890, now seen corresponding path program 1 times [2025-04-29 11:19:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:20,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304135715] [2025-04-29 11:19:20,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:20,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:20,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:20,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304135715] [2025-04-29 11:19:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304135715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:20,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781835499] [2025-04-29 11:19:20,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:20,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:20,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:19:20,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:19:20,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:20,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:20,818 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-29 11:19:20,822 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-29 11:19:20,839 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:19:20,840 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 18 [2025-04-29 11:19:20,869 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-29 11:19:20,871 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-29 11:19:20,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:20,970 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 18 treesize of output 10 [2025-04-29 11:19:20,999 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-29 11:19:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781835499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:20,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:20,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 21 [2025-04-29 11:19:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863924533] [2025-04-29 11:19:20,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:20,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:19:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:21,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:19:21,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:19:21,000 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-04-29 11:19:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:21,369 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-04-29 11:19:21,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:21,369 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2025-04-29 11:19:21,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:21,370 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:19:21,370 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:19:21,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=480, Unknown=1, NotChecked=44, Total=600 [2025-04-29 11:19:21,370 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:21,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 646 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 773 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2025-04-29 11:19:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:19:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-04-29 11:19:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 93 states have internal predecessors, (97), 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-29 11:19:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-04-29 11:19:21,374 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 46 [2025-04-29 11:19:21,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:21,374 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-04-29 11:19:21,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-04-29 11:19:21,374 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-04-29 11:19:21,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:21,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:21,375 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-29 11:19:21,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:19:21,575 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-29 11:19:21,575 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:21,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1086518891, now seen corresponding path program 1 times [2025-04-29 11:19:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:21,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415371395] [2025-04-29 11:19:21,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:21,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:21,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:21,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:21,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:21,955 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-29 11:19:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:21,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415371395] [2025-04-29 11:19:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415371395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:21,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716747532] [2025-04-29 11:19:21,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:21,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:21,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:21,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:19:22,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:22,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:22,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:22,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:22,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-29 11:19:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:22,158 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-29 11:19:22,376 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-29 11:19:22,378 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-29 11:19:22,412 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|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-04-29 11:19:22,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:22,447 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-29 11:19:22,453 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:19:22,453 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-29 11:19:22,502 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-29 11:19:22,519 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-29 11:19:22,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716747532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:22,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:22,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-04-29 11:19:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941405052] [2025-04-29 11:19:22,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:22,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:19:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:22,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:19:22,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=790, Unknown=1, NotChecked=56, Total=930 [2025-04-29 11:19:22,639 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 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-29 11:19:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,359 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2025-04-29 11:19:23,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:19:23,359 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 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-29 11:19:23,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,360 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:19:23,360 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:19:23,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1564, Unknown=1, NotChecked=80, Total=1806 [2025-04-29 11:19:23,360 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 73 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 919 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1151 Invalid, 0 Unknown, 102 Unchecked, 0.5s Time] [2025-04-29 11:19:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:19:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-04-29 11:19:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 99 states have internal predecessors, (103), 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-29 11:19:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2025-04-29 11:19:23,362 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 46 [2025-04-29 11:19:23,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,363 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2025-04-29 11:19:23,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 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-29 11:19:23,363 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2025-04-29 11:19:23,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:19:23,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,363 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-29 11:19:23,370 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-29 11:19:23,566 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-29 11:19:23,567 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:23,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 467601323, now seen corresponding path program 1 times [2025-04-29 11:19:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121622266] [2025-04-29 11:19:23,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:23,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:23,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:24,338 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-29 11:19:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:24,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121622266] [2025-04-29 11:19:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121622266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:24,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677752590] [2025-04-29 11:19:24,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:24,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:24,343 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:24,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:19:24,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:24,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:24,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:24,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:24,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-29 11:19:24,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:24,629 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-29 11:19:24,699 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-29 11:19:24,705 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:19:24,705 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-29 11:19:24,753 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 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|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2025-04-29 11:19:24,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:24,768 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-29 11:19:24,790 INFO L325 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2025-04-29 11:19:24,791 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 40 treesize of output 69 [2025-04-29 11:19:24,874 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 62 treesize of output 42 [2025-04-29 11:19:24,877 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 37 treesize of output 25 [2025-04-29 11:19:24,922 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 31 treesize of output 13 [2025-04-29 11:19:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:24,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677752590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [19] total 32 [2025-04-29 11:19:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112818301] [2025-04-29 11:19:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:24,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:19:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:24,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:19:24,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=914, Unknown=1, NotChecked=60, Total=1056 [2025-04-29 11:19:24,998 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 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-29 11:19:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:25,312 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2025-04-29 11:19:25,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:19:25,312 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 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 48 [2025-04-29 11:19:25,313 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:25,313 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:19:25,313 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:19:25,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1161, Unknown=1, NotChecked=68, Total=1332 [2025-04-29 11:19:25,314 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:25,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 413 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 151 Unchecked, 0.2s Time] [2025-04-29 11:19:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:19:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:19:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 98 states have internal predecessors, (102), 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-29 11:19:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2025-04-29 11:19:25,316 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 48 [2025-04-29 11:19:25,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:25,316 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2025-04-29 11:19:25,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 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-29 11:19:25,316 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2025-04-29 11:19:25,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:19:25,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:25,316 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-29 11:19:25,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:25,516 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-29 11:19:25,517 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:25,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 467601324, now seen corresponding path program 1 times [2025-04-29 11:19:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:25,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124942785] [2025-04-29 11:19:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:25,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:25,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124942785] [2025-04-29 11:19:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124942785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:26,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912344719] [2025-04-29 11:19:26,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:26,464 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-29 11:19:26,465 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-29 11:19:26,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:26,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:26,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-04-29 11:19:26,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:26,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:26,817 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-29 11:19:27,048 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:27,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:19:27,059 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:27,059 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-29 11:19:27,278 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-29 11:19:27,280 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-29 11:19:27,429 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-29 11:19:27,432 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-29 11:19:27,434 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-29 11:19:27,440 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-29 11:19:27,592 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_8| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2025-04-29 11:19:27,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:27,621 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-29 11:19:27,638 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 11:19:27,638 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-29 11:19:27,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 11:19:27,648 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-29 11:19:27,726 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-29 11:19:27,764 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-29 11:19:27,767 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-29 11:19:27,830 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-29 11:19:27,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912344719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:28,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2025-04-29 11:19:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864020948] [2025-04-29 11:19:28,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:28,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:19:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:28,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:19:28,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2305, Unknown=1, NotChecked=96, Total=2550 [2025-04-29 11:19:28,125 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 46 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 39 states have internal predecessors, (76), 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-29 11:19:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:29,645 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2025-04-29 11:19:29,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:19:29,645 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 39 states have internal predecessors, (76), 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 48 [2025-04-29 11:19:29,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:29,646 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:19:29,646 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:19:29,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=308, Invalid=4387, Unknown=1, NotChecked=134, Total=4830 [2025-04-29 11:19:29,647 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:29,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1435 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1642 Invalid, 0 Unknown, 104 Unchecked, 0.8s Time] [2025-04-29 11:19:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:19:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-29 11:19:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.364864864864865) internal successors, (101), 97 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-29 11:19:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2025-04-29 11:19:29,649 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 48 [2025-04-29 11:19:29,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:29,650 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2025-04-29 11:19:29,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 39 states have internal predecessors, (76), 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-29 11:19:29,650 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2025-04-29 11:19:29,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:19:29,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:29,650 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-29 11:19:29,658 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-29 11:19:29,850 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-29 11:19:29,851 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:29,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1285322166, now seen corresponding path program 1 times [2025-04-29 11:19:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:29,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335762990] [2025-04-29 11:19:29,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:29,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:19:29,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:19:29,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:30,017 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-29 11:19:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:30,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335762990] [2025-04-29 11:19:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335762990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134317945] [2025-04-29 11:19:30,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:30,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:30,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:30,020 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-29 11:19:30,024 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-29 11:19:30,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:19:30,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:19:30,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:30,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:30,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:19:30,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:30,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:30,235 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-29 11:19:30,253 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-29 11:19:30,256 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-29 11:19:30,272 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-29 11:19:30,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:30,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:30,305 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:30,305 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-29 11:19:30,332 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-29 11:19:30,348 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-29 11:19:30,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:30,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:30,415 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-29 11:19:30,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:30,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:30,469 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-29 11:19:30,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134317945] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-04-29 11:19:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639004529] [2025-04-29 11:19:30,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:30,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:19:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:30,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:19:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=233, Unknown=2, NotChecked=62, Total=342 [2025-04-29 11:19:30,558 INFO L87 Difference]: Start difference. First operand 103 states and 107 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-29 11:19:30,568 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-29 11:19:30,570 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-29 11:19:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:30,801 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2025-04-29 11:19:30,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:19:30,803 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-29 11:19:30,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:30,804 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:30,804 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:30,804 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-29 11:19:30,808 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:30,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 561 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 286 Unchecked, 0.2s Time] [2025-04-29 11:19:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 91 states have internal predecessors, (94), 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-29 11:19:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2025-04-29 11:19:30,811 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 49 [2025-04-29 11:19:30,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:30,811 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2025-04-29 11:19:30,811 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-29 11:19:30,811 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2025-04-29 11:19:30,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:19:30,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:30,811 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-29 11:19:30,818 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-29 11:19:31,011 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-29 11:19:31,012 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:31,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1445485556, now seen corresponding path program 1 times [2025-04-29 11:19:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694531189] [2025-04-29 11:19:31,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:31,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,082 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-29 11:19:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:31,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694531189] [2025-04-29 11:19:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694531189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110331930] [2025-04-29 11:19:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:31,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:31,084 INFO L87 Difference]: Start difference. First operand 97 states and 100 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-29 11:19:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,146 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-04-29 11:19:31,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:31,146 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-29 11:19:31,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,147 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:19:31,147 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:19:31,147 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-29 11:19:31,147 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 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-29 11:19:31,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:19:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:19:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 90 states have internal predecessors, (93), 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-29 11:19:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2025-04-29 11:19:31,150 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 54 [2025-04-29 11:19:31,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,150 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2025-04-29 11:19:31,150 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-29 11:19:31,150 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2025-04-29 11:19:31,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:19:31,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,150 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-29 11:19:31,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:19:31,150 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:31,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1445485557, now seen corresponding path program 1 times [2025-04-29 11:19:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567090448] [2025-04-29 11:19:31,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:31,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:31,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,389 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-29 11:19:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:31,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567090448] [2025-04-29 11:19:31,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567090448] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:31,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135512141] [2025-04-29 11:19:31,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:31,391 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-29 11:19:31,393 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-29 11:19:31,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:31,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:31,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:19:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:31,633 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-29 11:19:31,635 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-29 11:19:31,650 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-29 11:19:31,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135512141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2025-04-29 11:19:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041853449] [2025-04-29 11:19:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:31,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:31,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:31,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:31,652 INFO L87 Difference]: Start difference. First operand 96 states and 99 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-29 11:19:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,712 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2025-04-29 11:19:31,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:31,712 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-29 11:19:31,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,713 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:31,713 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:31,713 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-29 11:19:31,713 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:31,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.295774647887324) internal successors, (92), 89 states have internal predecessors, (92), 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-29 11:19:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2025-04-29 11:19:31,715 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 54 [2025-04-29 11:19:31,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,716 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2025-04-29 11:19:31,716 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-29 11:19:31,716 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2025-04-29 11:19:31,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:19:31,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,718 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-29 11:19:31,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:31,922 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-29 11:19:31,922 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:31,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 789579011, now seen corresponding path program 1 times [2025-04-29 11:19:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335102271] [2025-04-29 11:19:31,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:19:31,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:19:31,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,061 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-29 11:19:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:32,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335102271] [2025-04-29 11:19:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335102271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:19:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815023649] [2025-04-29 11:19:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:32,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:19:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:32,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:19:32,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:19:32,062 INFO L87 Difference]: Start difference. First operand 95 states and 98 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-29 11:19:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:32,173 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-04-29 11:19:32,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:32,173 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-29 11:19:32,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:32,174 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:32,174 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:32,174 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-29 11:19:32,174 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 357 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-29 11:19:32,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 357 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 89 states have internal predecessors, (93), 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-29 11:19:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-04-29 11:19:32,177 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 59 [2025-04-29 11:19:32,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:32,177 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-04-29 11:19:32,177 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-29 11:19:32,177 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-04-29 11:19:32,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:19:32,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:32,177 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-29 11:19:32,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:19:32,177 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:32,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 789579012, now seen corresponding path program 1 times [2025-04-29 11:19:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:32,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010626286] [2025-04-29 11:19:32,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:32,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:19:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:19:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,671 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-29 11:19:32,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:32,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010626286] [2025-04-29 11:19:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010626286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:32,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21528847] [2025-04-29 11:19:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:32,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:32,673 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-29 11:19:32,674 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-29 11:19:32,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:19:32,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:19:32,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:19:32,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:32,861 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-29 11:19:33,066 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-29 11:19:33,068 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-29 11:19:33,100 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$#0.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-29 11:19:33,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:33,145 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-29 11:19:33,152 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:19:33,152 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-29 11:19:33,335 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,336 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-29 11:19:33,341 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-29 11:19:33,393 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-29 11:19:33,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21528847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:33,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2025-04-29 11:19:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422543244] [2025-04-29 11:19:33,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:33,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:19:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:33,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:19:33,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1150, Unknown=1, NotChecked=68, Total=1332 [2025-04-29 11:19:33,575 INFO L87 Difference]: Start difference. First operand 95 states and 99 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-29 11:19:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:34,277 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2025-04-29 11:19:34,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:19:34,278 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-29 11:19:34,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:34,278 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:34,278 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:34,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1802, Unknown=1, NotChecked=86, Total=2070 [2025-04-29 11:19:34,279 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 68 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:34,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 903 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1186 Invalid, 0 Unknown, 93 Unchecked, 0.5s Time] [2025-04-29 11:19:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 91 states have internal predecessors, (94), 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-29 11:19:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2025-04-29 11:19:34,281 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 59 [2025-04-29 11:19:34,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:34,281 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2025-04-29 11:19:34,281 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-29 11:19:34,281 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2025-04-29 11:19:34,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:19:34,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:34,282 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-29 11:19:34,289 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-29 11:19:34,482 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-29 11:19:34,482 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:34,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1276758118, now seen corresponding path program 1 times [2025-04-29 11:19:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:34,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520725569] [2025-04-29 11:19:34,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:34,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:19:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:19:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:34,604 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-29 11:19:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:34,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520725569] [2025-04-29 11:19:34,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520725569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:34,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:34,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421645744] [2025-04-29 11:19:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:34,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:34,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:34,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:34,606 INFO L87 Difference]: Start difference. First operand 97 states and 100 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-29 11:19:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:34,696 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-04-29 11:19:34,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:34,696 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-29 11:19:34,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:34,697 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:19:34,697 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:19:34,697 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-29 11:19:34,698 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:34,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 322 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:19:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:19:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 90 states have internal predecessors, (93), 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-29 11:19:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2025-04-29 11:19:34,700 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 64 [2025-04-29 11:19:34,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:34,700 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2025-04-29 11:19:34,700 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-29 11:19:34,700 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2025-04-29 11:19:34,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:19:34,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:34,700 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-29 11:19:34,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:19:34,701 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:34,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1276758119, now seen corresponding path program 1 times [2025-04-29 11:19:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:34,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236563416] [2025-04-29 11:19:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:34,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:19:34,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:19:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:34,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,048 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-29 11:19:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236563416] [2025-04-29 11:19:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236563416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:35,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894921864] [2025-04-29 11:19:35,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:35,051 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-29 11:19:35,052 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-29 11:19:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:19:35,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:19:35,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:19:35,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:35,428 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-29 11:19:35,430 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-29 11:19:35,453 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-29 11:19:35,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894921864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2025-04-29 11:19:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38877779] [2025-04-29 11:19:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:19:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:19:35,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:19:35,455 INFO L87 Difference]: Start difference. First operand 96 states and 99 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-29 11:19:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:35,579 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2025-04-29 11:19:35,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:35,579 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-29 11:19:35,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:35,580 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:35,580 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:35,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:19:35,580 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:35,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 461 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 89 states have internal predecessors, (92), 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-29 11:19:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2025-04-29 11:19:35,585 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 64 [2025-04-29 11:19:35,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:35,585 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2025-04-29 11:19:35,585 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-29 11:19:35,585 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2025-04-29 11:19:35,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:19:35,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:35,586 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-29 11:19:35,594 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-29 11:19:35,786 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,SelfDestructingSolverStorable27 [2025-04-29 11:19:35,786 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:35,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1396092629, now seen corresponding path program 1 times [2025-04-29 11:19:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260171952] [2025-04-29 11:19:35,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:19:35,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:19:35,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260171952] [2025-04-29 11:19:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260171952] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:37,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245836284] [2025-04-29 11:19:37,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:37,437 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-29 11:19:37,438 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-29 11:19:37,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:19:37,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:19:37,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-29 11:19:37,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:37,702 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-29 11:19:37,813 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-29 11:19:37,816 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:19:37,816 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-29 11:19:37,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:37,903 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-29 11:19:37,920 INFO L325 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-04-29 11:19:37,920 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-29 11:19:38,036 INFO L325 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2025-04-29 11:19:38,037 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 1 case distinctions, treesize of input 49 treesize of output 52 [2025-04-29 11:19:38,130 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:19:38,130 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 82 treesize of output 72 [2025-04-29 11:19:38,152 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-29 11:19:38,236 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 58 [2025-04-29 11:19:38,371 INFO L325 Elim1Store]: treesize reduction 49, result has 43.0 percent of original size [2025-04-29 11:19:38,371 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 1 case distinctions, treesize of input 128 treesize of output 92 [2025-04-29 11:19:39,293 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:39,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 254 [2025-04-29 11:19:39,301 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 174 treesize of output 146 [2025-04-29 11:19:39,513 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:39,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 142 [2025-04-29 11:19:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:39,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245836284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:39,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [33] total 53 [2025-04-29 11:19:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625149926] [2025-04-29 11:19:39,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:19:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:19:39,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2712, Unknown=0, NotChecked=0, Total=2862 [2025-04-29 11:19:39,754 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-29 11:19:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,878 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-04-29 11:19:40,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:19:40,878 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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 66 [2025-04-29 11:19:40,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,879 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:19:40,879 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:19:40,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=177, Invalid=3129, Unknown=0, NotChecked=0, Total=3306 [2025-04-29 11:19:40,880 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 672 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:19:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:19:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-04-29 11:19:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2531645569620253) 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-29 11:19:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-04-29 11:19:40,882 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 66 [2025-04-29 11:19:40,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,882 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-04-29 11:19:40,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-29 11:19:40,882 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-04-29 11:19:40,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:19:40,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,883 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-29 11:19:40,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:41,083 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-29 11:19:41,083 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2025-04-29 11:19:41,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1396092628, now seen corresponding path program 1 times [2025-04-29 11:19:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:41,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369446139] [2025-04-29 11:19:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:41,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:19:41,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:19:41,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,538 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-29 11:19:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:43,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369446139] [2025-04-29 11:19:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369446139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:43,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159616905] [2025-04-29 11:19:43,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:43,540 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-29 11:19:43,541 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-29 11:19:43,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:19:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:19:43,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-04-29 11:19:43,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:43,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:43,785 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-29 11:19:43,938 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:43,938 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 17 treesize of output 21 [2025-04-29 11:19:43,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:19:44,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:19:44,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:19:44,229 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 61 treesize of output 19 [2025-04-29 11:19:44,232 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 17 treesize of output 3 [2025-04-29 11:19:44,235 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-29 11:19:44,237 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-29 11:19:44,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:44,436 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 69 treesize of output 52 [2025-04-29 11:19:44,448 INFO L325 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2025-04-29 11:19:44,448 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 1 case distinctions, treesize of input 28 treesize of output 41 [2025-04-29 11:19:44,461 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-29 11:19:44,461 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 34 treesize of output 36 [2025-04-29 11:19:44,469 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 26 treesize of output 21 [2025-04-29 11:19:44,653 INFO L325 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2025-04-29 11:19:44,653 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 1 case distinctions, treesize of input 71 treesize of output 60 [2025-04-29 11:19:44,664 INFO L325 Elim1Store]: treesize reduction 55, result has 23.6 percent of original size [2025-04-29 11:19:44,664 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 1 case distinctions, treesize of input 29 treesize of output 28 [2025-04-29 11:19:44,828 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:19:44,828 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 119 treesize of output 103 [2025-04-29 11:19:44,844 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:19:44,844 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 134 treesize of output 136 [2025-04-29 11:19:44,888 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-29 11:19:44,909 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-29 11:19:44,931 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-29 11:19:45,051 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 105 treesize of output 82 [2025-04-29 11:19:45,072 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 26 treesize of output 21 [2025-04-29 11:19:45,228 INFO L325 Elim1Store]: treesize reduction 49, result has 43.0 percent of original size [2025-04-29 11:19:45,229 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 1 case distinctions, treesize of input 158 treesize of output 108 [2025-04-29 11:19:45,241 INFO L325 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2025-04-29 11:19:45,242 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 1 case distinctions, treesize of input 39 treesize of output 34 [2025-04-29 11:19:46,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:46,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 422 treesize of output 406 [2025-04-29 11:19:46,708 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 283 treesize of output 235 [2025-04-29 11:19:47,039 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:47,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 233 treesize of output 195 [2025-04-29 11:19:47,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:47,061 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 124 treesize of output 142 [2025-04-29 11:19:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:47,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:05,140 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse2 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (or (< 0 (+ 9 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4))) (not (let ((.cse5 (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3))) (= (select .cse5 .cse4) (select .cse5 |ULTIMATE.start_main_~ptr~0#1.offset|))))))) (forall ((|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse8 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse10 (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3))) (let ((.cse9 (select .cse10 .cse4))) (or (< (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 11) (select |c_#length| .cse9)) (not (= .cse9 (select .cse10 |ULTIMATE.start_main_~ptr~0#1.offset|)))))))))) is different from false [2025-04-29 11:20:05,244 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (or (not (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse5))) (= (select .cse0 |ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 .cse1)))) (< 0 (+ 9 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse5) .cse1)))))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse8 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse10 (select (let ((.cse11 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse5))) (let ((.cse9 (select .cse10 .cse1))) (or (< (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse5) .cse1) 11) (select |c_#length| .cse9)) (not (= (select .cse10 |ULTIMATE.start_main_~ptr~0#1.offset|) .cse9))))))))) is different from false [2025-04-29 11:20:05,411 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse6 (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3))) (let ((.cse5 (select .cse6 .cse4))) (or (< (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4) 11) (select |c_#length| .cse5)) (not (= .cse5 (select .cse6 |ULTIMATE.start_main_~ptr~0#1.offset|)))))))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (or (< 0 (+ 9 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3934))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse3) .cse4))) (not (let ((.cse11 (select (let ((.cse12 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3933))) (store .cse12 .cse9 (store (select .cse12 .cse9) .cse10 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse3))) (= (select .cse11 .cse4) (select .cse11 |ULTIMATE.start_main_~ptr~0#1.offset|))))))))) is different from false [2025-04-29 11:20:05,466 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse1 (select (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_3933))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|))) .cse5))) (let ((.cse0 (select .cse1 .cse6))) (or (not (= .cse0 (select .cse1 |ULTIMATE.start_main_~ptr~0#1.offset|))) (< (+ 11 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_3934))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|))) .cse5) .cse6)) (select |c_#length| .cse0))))))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| Int) (|ULTIMATE.start_dll_circular_append_~head#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3934 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (or (not (let ((.cse8 (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_3933))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base|))) .cse5))) (= (select .cse8 .cse6) (select .cse8 |ULTIMATE.start_main_~ptr~0#1.offset|)))) (< 0 (+ 9 (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.base| v_ArrVal_3934))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret6#1.offset|))) .cse5) .cse6)))))))) is different from false [2025-04-29 11:20:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159616905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:06,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 59 [2025-04-29 11:20:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623781631] [2025-04-29 11:20:06,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:06,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-29 11:20:06,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:06,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-29 11:20:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4702, Unknown=5, NotChecked=564, Total=5550 [2025-04-29 11:20:06,107 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 60 states, 57 states have (on average 2.0) internal successors, (114), 53 states have internal predecessors, (114), 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) Killed by 15