./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.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_remove_all_reverse.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 8d2a13c8ee01ce2939efe770c0c02e73e3e360ade7884d56be15c977b3caac01 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:22,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:22,158 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:22,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:22,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:22,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:22,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:22,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:22,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:22,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:22,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:22,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:22,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:22,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:22,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:22,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:22,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:22,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:22,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:22,199 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 -> 8d2a13c8ee01ce2939efe770c0c02e73e3e360ade7884d56be15c977b3caac01 [2025-04-29 11:19:22,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:22,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:22,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:22,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:22,445 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:22,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c [2025-04-29 11:19:23,831 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd1e0cf7/5d0bfcee003349fbaff85c361b109121/FLAG448eff1ce [2025-04-29 11:19:24,117 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:24,118 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c [2025-04-29 11:19:24,120 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:24,120 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:24,127 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd1e0cf7/5d0bfcee003349fbaff85c361b109121/FLAG448eff1ce [2025-04-29 11:19:24,833 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd1e0cf7/5d0bfcee003349fbaff85c361b109121 [2025-04-29 11:19:24,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:24,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:24,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:24,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:24,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:24,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:24" (1/1) ... [2025-04-29 11:19:24,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0edf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:24, skipping insertion in model container [2025-04-29 11:19:24,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:24" (1/1) ... [2025-04-29 11:19:24,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:25,016 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:25,022 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:25,044 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:25,057 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:25,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:25 WrapperNode [2025-04-29 11:19:25,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:25,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:25,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:25,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:25,064 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:25" (1/1) ... [2025-04-29 11:19:25,073 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:25" (1/1) ... [2025-04-29 11:19:25,092 INFO L138 Inliner]: procedures = 17, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-04-29 11:19:25,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:25,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:25,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:25,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:25,101 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:25" (1/1) ... [2025-04-29 11:19:25,101 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:25" (1/1) ... [2025-04-29 11:19:25,103 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:25" (1/1) ... [2025-04-29 11:19:25,116 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [8, 11]. 58 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 10 writes are split as follows [1, 9]. [2025-04-29 11:19:25,118 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:25" (1/1) ... [2025-04-29 11:19:25,119 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:25" (1/1) ... [2025-04-29 11:19:25,126 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:25" (1/1) ... [2025-04-29 11:19:25,131 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:25" (1/1) ... [2025-04-29 11:19:25,133 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:25" (1/1) ... [2025-04-29 11:19:25,137 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:25" (1/1) ... [2025-04-29 11:19:25,138 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:25" (1/1) ... [2025-04-29 11:19:25,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:25,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:25,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:25,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:25,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:25" (1/1) ... [2025-04-29 11:19:25,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:25,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:25,173 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:25,178 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:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:25,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:19:25,196 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:19:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:25,273 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:25,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:25,549 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:25,549 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:25,562 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:25,563 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:19:25,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:25 BoogieIcfgContainer [2025-04-29 11:19:25,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:25,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:25,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:25,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:25,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:24" (1/3) ... [2025-04-29 11:19:25,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703e2098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:25, skipping insertion in model container [2025-04-29 11:19:25,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:25" (2/3) ... [2025-04-29 11:19:25,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703e2098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:25, skipping insertion in model container [2025-04-29 11:19:25,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:25" (3/3) ... [2025-04-29 11:19:25,570 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.c [2025-04-29 11:19:25,580 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:25,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.c that has 2 procedures, 97 locations, 105 edges, 1 initial locations, 2 loop locations, and 43 error locations. [2025-04-29 11:19:25,610 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:25,622 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;@25341a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:25,622 INFO L341 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-04-29 11:19:25,625 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 50 states have (on average 1.98) internal successors, (99), 93 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:25,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:25,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:25,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:25,630 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:25,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 893332978, now seen corresponding path program 1 times [2025-04-29 11:19:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:25,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218088048] [2025-04-29 11:19:25,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:25,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,827 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:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:25,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218088048] [2025-04-29 11:19:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218088048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:25,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:25,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472472902] [2025-04-29 11:19:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:25,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:25,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:25,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:25,851 INFO L87 Difference]: Start difference. First operand has 97 states, 50 states have (on average 1.98) internal successors, (99), 93 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:25,975 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-04-29 11:19:25,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:25,977 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:25,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:25,982 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:19:25,982 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:19:25,983 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:25,985 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:25,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 138 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:19:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-29 11:19:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 46 states have (on average 1.934782608695652) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-04-29 11:19:26,015 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 6 [2025-04-29 11:19:26,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,016 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-04-29 11:19:26,017 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:26,017 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-04-29 11:19:26,017 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:26,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:26,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:26,019 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:26,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 893332979, now seen corresponding path program 1 times [2025-04-29 11:19:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850652653] [2025-04-29 11:19:26,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,104 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:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850652653] [2025-04-29 11:19:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850652653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897999405] [2025-04-29 11:19:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:26,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:26,106 INFO L87 Difference]: Start difference. First operand 89 states and 93 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:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,167 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-04-29 11:19:26,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:26,168 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:26,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,168 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:19:26,169 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:19:26,169 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:26,169 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:26,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 138 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:19:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:19:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-04-29 11:19:26,175 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 6 [2025-04-29 11:19:26,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,175 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-04-29 11:19:26,175 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:26,176 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-04-29 11:19:26,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:26,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:26,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:26,176 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:26,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1155503112, now seen corresponding path program 1 times [2025-04-29 11:19:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806100145] [2025-04-29 11:19:26,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:26,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:26,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,266 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:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806100145] [2025-04-29 11:19:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806100145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724056031] [2025-04-29 11:19:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:26,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:26,270 INFO L87 Difference]: Start difference. First operand 86 states and 90 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:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,287 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-04-29 11:19:26,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:26,287 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:26,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,288 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:26,288 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:26,288 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:26,289 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 171 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:26,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 171 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:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-04-29 11:19:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.851063829787234) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-04-29 11:19:26,295 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 14 [2025-04-29 11:19:26,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,295 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-04-29 11:19:26,295 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:26,295 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-04-29 11:19:26,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:26,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,296 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:26,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:26,296 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:26,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1704624603, now seen corresponding path program 1 times [2025-04-29 11:19:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745489938] [2025-04-29 11:19:26,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:26,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:26,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,464 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:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745489938] [2025-04-29 11:19:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745489938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699948527] [2025-04-29 11:19:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:26,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:26,466 INFO L87 Difference]: Start difference. First operand 87 states and 91 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:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,626 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-04-29 11:19:26,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:26,627 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:26,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,627 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:19:26,628 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:19:26,629 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:26,629 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:26,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 236 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:19:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:19:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-04-29 11:19:26,634 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 24 [2025-04-29 11:19:26,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,635 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-04-29 11:19:26,635 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:26,635 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-04-29 11:19:26,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:26,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,635 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:26,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:26,636 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:26,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1704624602, now seen corresponding path program 1 times [2025-04-29 11:19:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869038507] [2025-04-29 11:19:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:26,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:26,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,844 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:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869038507] [2025-04-29 11:19:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869038507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562004988] [2025-04-29 11:19:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:26,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:26,847 INFO L87 Difference]: Start difference. First operand 86 states and 90 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:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,967 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-04-29 11:19:26,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:26,968 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:26,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,968 INFO L225 Difference]: With dead ends: 85 [2025-04-29 11:19:26,968 INFO L226 Difference]: Without dead ends: 85 [2025-04-29 11:19:26,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:26,969 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:26,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-29 11:19:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-29 11:19:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-04-29 11:19:26,978 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 24 [2025-04-29 11:19:26,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,978 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-04-29 11:19:26,978 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:26,978 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-04-29 11:19:26,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:26,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,979 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:26,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:19:26,979 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:26,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1761704154, now seen corresponding path program 1 times [2025-04-29 11:19:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114358852] [2025-04-29 11:19:26,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:27,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:27,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,217 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:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:27,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114358852] [2025-04-29 11:19:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114358852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:27,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474756460] [2025-04-29 11:19:27,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:27,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:27,220 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:27,222 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:27,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:27,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:27,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:19:27,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:27,340 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:27,383 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:27,443 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:27,444 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:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:27,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474756460] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:27,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-04-29 11:19:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959146097] [2025-04-29 11:19:27,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:27,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-04-29 11:19:27,511 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:27,777 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-04-29 11:19:27,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:27,777 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-04-29 11:19:27,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:27,778 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:19:27,778 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:19:27,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:19:27,779 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:27,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 324 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2025-04-29 11:19:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:19:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-29 11:19:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 85 states have internal predecessors, (91), 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:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-04-29 11:19:27,783 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 26 [2025-04-29 11:19:27,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:27,783 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-04-29 11:19:27,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:27,783 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-04-29 11:19:27,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:27,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:27,784 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:27,794 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:27,984 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:27,985 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:27,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1761704153, now seen corresponding path program 1 times [2025-04-29 11:19:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:27,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165106633] [2025-04-29 11:19:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:28,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:28,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:28,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:28,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:28,251 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:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:28,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165106633] [2025-04-29 11:19:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165106633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:28,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080025323] [2025-04-29 11:19:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:28,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:28,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:28,256 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:28,257 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:28,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:28,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:19:28,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:28,356 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:28,360 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:28,517 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:28,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:28,563 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:28,571 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:28,571 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:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:28,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080025323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:28,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:28,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-04-29 11:19:28,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233964049] [2025-04-29 11:19:28,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:28,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:19:28,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:28,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:19:28,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2025-04-29 11:19:28,712 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:29,044 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2025-04-29 11:19:29,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:29,045 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-04-29 11:19:29,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:29,045 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:19:29,045 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:19:29,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:19:29,046 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:29,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 460 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2025-04-29 11:19:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:19:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-29 11:19:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 85 states have internal predecessors, (90), 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:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2025-04-29 11:19:29,056 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 26 [2025-04-29 11:19:29,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:29,056 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-04-29 11:19:29,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:29,056 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2025-04-29 11:19:29,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:19:29,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:29,057 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:29,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:19:29,257 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:29,258 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:29,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash -780422808, now seen corresponding path program 1 times [2025-04-29 11:19:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:29,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509591712] [2025-04-29 11:19:29,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:29,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:29,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,335 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:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:29,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509591712] [2025-04-29 11:19:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509591712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:29,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180829493] [2025-04-29 11:19:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:29,337 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:29,339 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:29,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:29,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:29,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:19:29,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:29,453 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:29,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:29,480 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:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180829493] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:29,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 11:19:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435257398] [2025-04-29 11:19:29,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:29,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:29,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:29,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:29,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:29,482 INFO L87 Difference]: Start difference. First operand 90 states and 96 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:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:29,519 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-04-29 11:19:29,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:29,519 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:29,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:29,520 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:19:29,521 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:19:29,521 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:29,522 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 379 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:29,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 379 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:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:19:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-29 11:19:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 85 states have internal predecessors, (89), 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:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-04-29 11:19:29,527 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 28 [2025-04-29 11:19:29,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:29,527 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-04-29 11:19:29,527 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:29,527 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-04-29 11:19:29,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:29,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:29,528 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:29,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:29,734 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:29,734 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:29,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1571898420, now seen corresponding path program 1 times [2025-04-29 11:19:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:29,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635164030] [2025-04-29 11:19:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:29,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,797 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:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:29,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635164030] [2025-04-29 11:19:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635164030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:29,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180827263] [2025-04-29 11:19:29,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:29,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:29,800 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:29,801 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:29,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:29,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:29,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:19:29,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:29,894 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:29,940 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:29,981 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:29,983 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:29,993 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:29,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180827263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-29 11:19:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438720783] [2025-04-29 11:19:30,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:30,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:19:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:19:30,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-29 11:19:30,043 INFO L87 Difference]: Start difference. First operand 90 states and 95 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:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:30,237 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-04-29 11:19:30,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:30,238 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:30,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:30,238 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:19:30,238 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:19:30,239 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:30,239 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:30,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 288 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2025-04-29 11:19:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:19:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-29 11:19:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 84 states have internal predecessors, (88), 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:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2025-04-29 11:19:30,242 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 29 [2025-04-29 11:19:30,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:30,242 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-04-29 11:19:30,242 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:30,242 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2025-04-29 11:19:30,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:30,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:30,243 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:30,250 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:30,447 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:30,447 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:30,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1571898421, now seen corresponding path program 1 times [2025-04-29 11:19:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:30,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635924491] [2025-04-29 11:19:30,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:30,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:30,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:30,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:30,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:30,597 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:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:30,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635924491] [2025-04-29 11:19:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635924491] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000417790] [2025-04-29 11:19:30,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:30,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:30,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:30,601 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:30,602 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:30,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:30,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:30,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:19:30,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:30,710 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,714 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,831 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,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:30,868 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,875 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:30,875 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,907 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:30,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000417790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-29 11:19:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772198936] [2025-04-29 11:19:30,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:30,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:30,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:30,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:30,995 INFO L87 Difference]: Start difference. First operand 89 states and 94 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:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,256 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-04-29 11:19:31,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:19:31,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:31,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,258 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:19:31,258 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:19:31,259 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:31,259 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:31,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 526 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2025-04-29 11:19:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:19:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2025-04-29 11:19:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.7) internal successors, (102), 93 states have internal predecessors, (102), 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:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-04-29 11:19:31,264 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 29 [2025-04-29 11:19:31,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,264 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-04-29 11:19:31,264 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:31,264 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-04-29 11:19:31,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:31,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,265 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:31,273 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:31,469 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:31,469 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:31,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1484210763, now seen corresponding path program 1 times [2025-04-29 11:19:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741995673] [2025-04-29 11:19:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:31,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,568 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:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:31,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741995673] [2025-04-29 11:19:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741995673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412084102] [2025-04-29 11:19:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:31,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:31,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:31,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:31,569 INFO L87 Difference]: Start difference. First operand 99 states and 110 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:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,693 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2025-04-29 11:19:31,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:31,694 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:31,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,695 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:19:31,695 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:19:31,695 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:31,696 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:31,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 261 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:19:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-04-29 11:19:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 92 states have internal predecessors, (101), 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:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-04-29 11:19:31,702 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 30 [2025-04-29 11:19:31,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,702 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-04-29 11:19:31,702 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:31,702 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-04-29 11:19:31,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:31,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,704 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:31,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:19:31,704 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:31,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1484210764, now seen corresponding path program 1 times [2025-04-29 11:19:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626639402] [2025-04-29 11:19:31,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,853 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:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:31,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626639402] [2025-04-29 11:19:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626639402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85358971] [2025-04-29 11:19:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:31,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:31,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:31,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:31,854 INFO L87 Difference]: Start difference. First operand 98 states and 109 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:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,979 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2025-04-29 11:19:31,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:31,979 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:31,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,980 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:31,980 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:31,980 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:31,980 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:31,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 291 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 91 states have internal predecessors, (100), 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:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2025-04-29 11:19:31,985 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 30 [2025-04-29 11:19:31,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,985 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2025-04-29 11:19:31,985 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:31,985 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2025-04-29 11:19:31,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:31,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,985 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, 1, 1, 1, 1] [2025-04-29 11:19:31,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:19:31,986 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:31,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -349692530, now seen corresponding path program 1 times [2025-04-29 11:19:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923057459] [2025-04-29 11:19:31,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:32,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:32,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,234 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:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:32,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923057459] [2025-04-29 11:19:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923057459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:32,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578484848] [2025-04-29 11:19:32,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:32,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:32,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:32,237 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:32,238 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:32,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:32,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:32,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-29 11:19:32,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:32,351 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:32,388 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-04-29 11:19:32,389 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-04-29 11:19:32,403 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-04-29 11:19:32,405 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-04-29 11:19:32,478 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3))))))) is different from false [2025-04-29 11:19:32,481 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3))))))) is different from true [2025-04-29 11:19:32,527 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))))) is different from false [2025-04-29 11:19:32,530 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))))) is different from true [2025-04-29 11:19:32,668 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3))))) is different from false [2025-04-29 11:19:32,671 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3))))) is different from true [2025-04-29 11:19:32,739 WARN L849 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2025-04-29 11:19:32,741 WARN L871 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2025-04-29 11:19:32,815 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))))) is different from false [2025-04-29 11:19:32,818 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))))) is different from true [2025-04-29 11:19:32,889 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from false [2025-04-29 11:19:32,892 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from true [2025-04-29 11:19:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2025-04-29 11:19:32,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:33,281 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:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578484848] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:33,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 29 [2025-04-29 11:19:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506481664] [2025-04-29 11:19:33,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:33,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 11:19:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:33,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 11:19:33,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=381, Unknown=16, NotChecked=376, Total=870 [2025-04-29 11:19:33,283 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 23 states have internal predecessors, (59), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:33,427 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2025-04-29 11:19:33,428 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2025-04-29 11:19:33,430 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2025-04-29 11:19:33,431 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2025-04-29 11:19:33,452 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2025-04-29 11:19:33,455 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2025-04-29 11:19:33,472 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse4))))))) is different from false [2025-04-29 11:19:33,475 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse4))))))) is different from true [2025-04-29 11:19:33,490 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4))))))) is different from false [2025-04-29 11:19:33,493 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse3 (select |c_#valid| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse4 (select |c_#valid| .cse4))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4))))))) is different from true [2025-04-29 11:19:33,504 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2025-04-29 11:19:33,506 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2025-04-29 11:19:33,519 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|)))))))) is different from false [2025-04-29 11:19:33,521 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|)))))))) is different from true [2025-04-29 11:19:33,528 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) .cse1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse1)) is different from false [2025-04-29 11:19:33,531 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((v_ArrVal_896 Int)) (= (select |c_#valid| v_ArrVal_896) 1)))) (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) .cse1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse1)) is different from true [2025-04-29 11:19:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:33,820 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2025-04-29 11:19:33,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:19:33,820 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 23 states have internal predecessors, (59), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2025-04-29 11:19:33,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:33,821 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:19:33,821 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:19:33,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=453, Unknown=32, NotChecked=944, Total=1560 [2025-04-29 11:19:33,822 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1216 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:33,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 542 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 687 Invalid, 0 Unknown, 1216 Unchecked, 0.4s Time] [2025-04-29 11:19:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:19:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-29 11:19:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 98 states have internal predecessors, (112), 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:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2025-04-29 11:19:33,825 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 34 [2025-04-29 11:19:33,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:33,826 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2025-04-29 11:19:33,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 23 states have internal predecessors, (59), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:33,826 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2025-04-29 11:19:33,828 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:33,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:33,828 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, 1, 1, 1, 1] [2025-04-29 11:19:33,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:19:34,031 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:34,031 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:34,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -349692529, now seen corresponding path program 1 times [2025-04-29 11:19:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:34,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539523065] [2025-04-29 11:19:34,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:34,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:34,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:34,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:34,291 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:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:34,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539523065] [2025-04-29 11:19:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539523065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:34,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692829434] [2025-04-29 11:19:34,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:34,294 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:34,296 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:34,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:34,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:34,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:34,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:34,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:19:34,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:34,417 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:34,427 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:34,433 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:34,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:34,457 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:34,473 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:34,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:34,503 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:34,530 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:34,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692829434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:34,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2025-04-29 11:19:34,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081767511] [2025-04-29 11:19:34,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:34,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:19:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:34,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:19:34,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-04-29 11:19:34,631 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-29 11:19:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:34,759 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-04-29 11:19:34,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:34,759 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-04-29 11:19:34,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:34,760 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:34,760 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:34,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:19:34,761 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:34,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 90 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2025-04-29 11:19:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 91 states have internal predecessors, (103), 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:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-04-29 11:19:34,766 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 34 [2025-04-29 11:19:34,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:34,766 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-04-29 11:19:34,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-29 11:19:34,766 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-04-29 11:19:34,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:34,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:34,766 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, 1, 1, 1, 1] [2025-04-29 11:19:34,773 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:34,966 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:34,967 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:34,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -349690770, now seen corresponding path program 1 times [2025-04-29 11:19:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:34,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124169043] [2025-04-29 11:19:34,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:34,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:34,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:34,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:34,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,043 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:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124169043] [2025-04-29 11:19:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124169043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:35,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688024233] [2025-04-29 11:19:35,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:35,046 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:35,051 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:35,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:35,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:35,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:19:35,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:35,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688024233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:35,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 11:19:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999844214] [2025-04-29 11:19:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:35,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:35,182 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:35,195 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-04-29 11:19:35,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:35,196 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-29 11:19:35,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:35,196 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:19:35,196 INFO L226 Difference]: Without dead ends: 137 [2025-04-29 11:19:35,196 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:35,197 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:35,197 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 156 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-29 11:19:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2025-04-29 11:19:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 92 states have internal predecessors, (103), 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:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-04-29 11:19:35,201 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 34 [2025-04-29 11:19:35,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:35,201 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-04-29 11:19:35,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,201 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-04-29 11:19:35,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:19:35,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:35,203 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, 1, 1, 1, 1, 1] [2025-04-29 11:19:35,210 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:35,404 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:35,404 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:35,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2044433470, now seen corresponding path program 1 times [2025-04-29 11:19:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514313624] [2025-04-29 11:19:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:19:35,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:19:35,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514313624] [2025-04-29 11:19:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514313624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756352696] [2025-04-29 11:19:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:35,499 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:35,620 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2025-04-29 11:19:35,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:35,621 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-04-29 11:19:35,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:35,621 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:19:35,621 INFO L226 Difference]: Without dead ends: 122 [2025-04-29 11:19:35,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:19:35,622 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:35,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 230 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-29 11:19:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2025-04-29 11:19:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 94 states have internal predecessors, (106), 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:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2025-04-29 11:19:35,626 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 35 [2025-04-29 11:19:35,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:35,626 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2025-04-29 11:19:35,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,626 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2025-04-29 11:19:35,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:19:35,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:35,627 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, 1, 1, 1, 1, 1] [2025-04-29 11:19:35,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:19:35,627 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:35,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2044433471, now seen corresponding path program 1 times [2025-04-29 11:19:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677982278] [2025-04-29 11:19:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:19:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:19:35,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,859 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:35,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677982278] [2025-04-29 11:19:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677982278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921094963] [2025-04-29 11:19:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:35,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:35,860 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,093 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2025-04-29 11:19:36,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:36,093 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2025-04-29 11:19:36,093 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,094 INFO L225 Difference]: With dead ends: 140 [2025-04-29 11:19:36,094 INFO L226 Difference]: Without dead ends: 140 [2025-04-29 11:19:36,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:36,094 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 399 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-04-29 11:19:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2025-04-29 11:19:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.511111111111111) internal successors, (136), 112 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2025-04-29 11:19:36,098 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 35 [2025-04-29 11:19:36,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,098 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2025-04-29 11:19:36,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:36,099 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2025-04-29 11:19:36,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:19:36,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,099 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:19:36,099 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:36,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1900510879, now seen corresponding path program 1 times [2025-04-29 11:19:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505211367] [2025-04-29 11:19:36,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:19:36,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:19:36,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505211367] [2025-04-29 11:19:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505211367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:36,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:36,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163974739] [2025-04-29 11:19:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:36,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:36,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:36,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:36,135 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,167 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2025-04-29 11:19:36,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:36,167 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 11:19:36,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,168 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:19:36,168 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:19:36,168 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:36,168 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:19:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-04-29 11:19:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 108 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:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2025-04-29 11:19:36,171 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 37 [2025-04-29 11:19:36,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,171 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2025-04-29 11:19:36,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:36,172 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2025-04-29 11:19:36,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:19:36,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:19:36,172 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:36,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1029855040, now seen corresponding path program 1 times [2025-04-29 11:19:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755165332] [2025-04-29 11:19:36,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:19:36,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:19:36,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,584 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:36,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755165332] [2025-04-29 11:19:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755165332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:19:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628102835] [2025-04-29 11:19:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:36,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:36,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:36,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:36,586 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,899 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2025-04-29 11:19:36,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:19:36,900 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 39 [2025-04-29 11:19:36,900 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,900 INFO L225 Difference]: With dead ends: 132 [2025-04-29 11:19:36,900 INFO L226 Difference]: Without dead ends: 132 [2025-04-29 11:19:36,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:19:36,901 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 433 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-29 11:19:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2025-04-29 11:19:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 111 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2025-04-29 11:19:36,905 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 39 [2025-04-29 11:19:36,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,905 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2025-04-29 11:19:36,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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:36,905 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2025-04-29 11:19:36,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:19:36,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:19:36,906 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:36,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1029855041, now seen corresponding path program 1 times [2025-04-29 11:19:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292345560] [2025-04-29 11:19:36,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:19:36,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:19:36,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,544 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:37,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292345560] [2025-04-29 11:19:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292345560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:37,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294889891] [2025-04-29 11:19:37,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:37,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:37,546 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:37,547 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:37,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:19:37,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:19:37,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-29 11:19:37,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:37,765 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:37,768 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:37,982 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:37,982 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:37,995 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:37,996 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:38,144 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:38,149 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:38,310 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 66 treesize of output 46 [2025-04-29 11:19:38,312 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 50 treesize of output 34 [2025-04-29 11:19:38,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:19:38,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:19:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:38,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:38,588 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 64 treesize of output 48 [2025-04-29 11:19:38,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-04-29 11:19:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294889891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:38,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:38,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2025-04-29 11:19:38,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503763537] [2025-04-29 11:19:38,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:38,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 11:19:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:38,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 11:19:38,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1857, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:19:38,804 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 31 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:39,934 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2025-04-29 11:19:39,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:19:39,934 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 31 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2025-04-29 11:19:39,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:39,935 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:19:39,935 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:19:39,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=3289, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 11:19:39,936 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 208 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:39,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 909 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:19:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:19:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2025-04-29 11:19:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.469387755102041) internal successors, (144), 118 states have internal predecessors, (144), 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:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2025-04-29 11:19:39,942 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 39 [2025-04-29 11:19:39,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:39,942 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2025-04-29 11:19:39,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 31 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:39,942 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2025-04-29 11:19:39,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:39,943 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:39,949 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:40,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,143 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:40,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1438704994, now seen corresponding path program 1 times [2025-04-29 11:19:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285624314] [2025-04-29 11:19:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:40,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,226 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:40,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285624314] [2025-04-29 11:19:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285624314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:40,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335802924] [2025-04-29 11:19:40,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:40,229 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:40,231 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:40,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:40,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:40,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:40,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:40,378 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:40,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335802924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:40,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:40,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:19:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135392128] [2025-04-29 11:19:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:40,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:40,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:40,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:40,379 INFO L87 Difference]: Start difference. First operand 124 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:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,388 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-04-29 11:19:40,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:40,389 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:40,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,389 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:40,389 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:40,389 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:40,390 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 91 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-04-29 11:19:40,392 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 41 [2025-04-29 11:19:40,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,392 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-04-29 11:19:40,392 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:40,392 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-04-29 11:19:40,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:19:40,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:40,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:40,599 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,SelfDestructingSolverStorable20 [2025-04-29 11:19:40,600 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:40,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1860721304, now seen corresponding path program 1 times [2025-04-29 11:19:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502118179] [2025-04-29 11:19:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:19:40,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:19:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,718 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:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502118179] [2025-04-29 11:19:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502118179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091932717] [2025-04-29 11:19:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:40,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:40,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:40,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:40,719 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,830 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-04-29 11:19:40,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:40,830 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2025-04-29 11:19:40,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,831 INFO L225 Difference]: With dead ends: 94 [2025-04-29 11:19:40,831 INFO L226 Difference]: Without dead ends: 94 [2025-04-29 11:19:40,831 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:40,832 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 362 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-29 11:19:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-04-29 11:19:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 90 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-04-29 11:19:40,835 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 40 [2025-04-29 11:19:40,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,835 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-04-29 11:19:40,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:40,835 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2025-04-29 11:19:40,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:40,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:40,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:19:40,836 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:40,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1847785664, now seen corresponding path program 1 times [2025-04-29 11:19:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822155979] [2025-04-29 11:19:40,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:40,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:40,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,997 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:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822155979] [2025-04-29 11:19:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822155979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:40,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:40,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567207451] [2025-04-29 11:19:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:40,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:40,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:40,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:40,999 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:41,190 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2025-04-29 11:19:41,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:41,190 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2025-04-29 11:19:41,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:41,191 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:19:41,191 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:19:41,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:41,191 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:41,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 404 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:19:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2025-04-29 11:19:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 93 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2025-04-29 11:19:41,194 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 41 [2025-04-29 11:19:41,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:41,195 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2025-04-29 11:19:41,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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:41,195 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2025-04-29 11:19:41,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:19:41,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:41,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:41,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:19:41,196 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:41,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1460140103, now seen corresponding path program 1 times [2025-04-29 11:19:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:41,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319902534] [2025-04-29 11:19:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:41,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:41,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:41,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,521 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:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:41,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319902534] [2025-04-29 11:19:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319902534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:41,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188814979] [2025-04-29 11:19:41,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:41,523 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:41,524 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:41,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:41,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-29 11:19:41,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:41,859 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 15 treesize of output 1 [2025-04-29 11:19:41,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-29 11:19:42,010 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:42,065 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:42,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:42,183 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 26 treesize of output 18 [2025-04-29 11:19:42,185 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 22 treesize of output 14 [2025-04-29 11:19:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:19:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188814979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:42,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 12] total 35 [2025-04-29 11:19:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630595613] [2025-04-29 11:19:42,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:42,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 11:19:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:42,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 11:19:42,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:19:42,283 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 11:19:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:42,651 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2025-04-29 11:19:42,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:19:42,651 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-04-29 11:19:42,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:42,652 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:19:42,652 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:19:42,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:19:42,652 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 135 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:42,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 557 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:19:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:19:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-04-29 11:19:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 94 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-04-29 11:19:42,654 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 42 [2025-04-29 11:19:42,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:42,656 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-04-29 11:19:42,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 11:19:42,656 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-04-29 11:19:42,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:19:42,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:42,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:42,664 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:42,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:19:42,857 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:42,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1446780826, now seen corresponding path program 1 times [2025-04-29 11:19:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:42,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654519924] [2025-04-29 11:19:42,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:42,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:42,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:42,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:42,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:42,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654519924] [2025-04-29 11:19:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654519924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123728288] [2025-04-29 11:19:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:42,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:42,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:42,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:42,910 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:42,968 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2025-04-29 11:19:42,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:42,969 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-04-29 11:19:42,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:42,969 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:42,969 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:42,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:42,970 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:42,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 93 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2025-04-29 11:19:42,972 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 42 [2025-04-29 11:19:42,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:42,972 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2025-04-29 11:19:42,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:42,972 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2025-04-29 11:19:42,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:42,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:42,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:42,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:19:42,973 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:42,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1900532739, now seen corresponding path program 1 times [2025-04-29 11:19:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:42,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398983697] [2025-04-29 11:19:42,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:42,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:42,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:42,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:43,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398983697] [2025-04-29 11:19:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398983697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:43,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557431129] [2025-04-29 11:19:43,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:43,142 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:43,144 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:43,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:43,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:43,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:19:43,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:43,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:43,357 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:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:43,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:43,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557431129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:43,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-04-29 11:19:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682462627] [2025-04-29 11:19:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:43,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:19:43,360 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:43,446 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-04-29 11:19:43,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:43,446 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-04-29 11:19:43,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:43,446 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:19:43,446 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:19:43,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:43,447 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:43,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:19:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:19:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 92 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2025-04-29 11:19:43,449 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 43 [2025-04-29 11:19:43,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:43,449 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2025-04-29 11:19:43,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:43,449 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2025-04-29 11:19:43,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:19:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:43,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:43,456 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:43,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:19:43,650 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:43,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1259663446, now seen corresponding path program 1 times [2025-04-29 11:19:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:43,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843826946] [2025-04-29 11:19:43,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:43,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:19:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:19:43,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:43,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843826946] [2025-04-29 11:19:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843826946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:19:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002044160] [2025-04-29 11:19:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:43,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:19:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:43,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:19:43,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:19:43,744 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:43,836 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-04-29 11:19:43,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:43,837 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-04-29 11:19:43,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:43,837 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:43,837 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:43,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:43,838 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 86 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:43,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 126 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.358974358974359) internal successors, (106), 91 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-04-29 11:19:43,841 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44 [2025-04-29 11:19:43,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:43,841 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-04-29 11:19:43,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:43,841 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-04-29 11:19:43,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:43,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:43,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:43,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:19:43,842 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:43,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -394861113, now seen corresponding path program 1 times [2025-04-29 11:19:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:43,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818746478] [2025-04-29 11:19:43,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:43,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:43,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:43,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:44,164 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:44,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:44,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818746478] [2025-04-29 11:19:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818746478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-29 11:19:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109682185] [2025-04-29 11:19:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:44,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:19:44,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:44,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:19:44,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:19:44,165 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:44,468 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2025-04-29 11:19:44,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:19:44,468 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 45 [2025-04-29 11:19:44,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:44,469 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:19:44,469 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:19:44,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:19:44,469 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 41 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:44,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 277 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:19:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2025-04-29 11:19:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 94 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-04-29 11:19:44,471 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 45 [2025-04-29 11:19:44,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:44,471 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-04-29 11:19:44,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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:44,471 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-04-29 11:19:44,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:44,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:44,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:44,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:19:44,475 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:44,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash -394861112, now seen corresponding path program 1 times [2025-04-29 11:19:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:44,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258934495] [2025-04-29 11:19:44,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:44,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:44,744 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:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:44,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258934495] [2025-04-29 11:19:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258934495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:19:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370686175] [2025-04-29 11:19:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:44,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:19:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:44,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:19:44,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:19:44,745 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:44,933 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2025-04-29 11:19:44,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:44,934 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 45 [2025-04-29 11:19:44,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:44,934 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:19:44,934 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:19:44,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:44,935 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:44,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 408 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:19:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2025-04-29 11:19:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 94 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-04-29 11:19:44,937 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 45 [2025-04-29 11:19:44,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:44,937 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-04-29 11:19:44,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:44,937 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-04-29 11:19:44,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:44,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:44,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:44,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:19:44,943 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:44,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1782976741, now seen corresponding path program 1 times [2025-04-29 11:19:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:44,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400895487] [2025-04-29 11:19:44,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:44,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:45,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400895487] [2025-04-29 11:19:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400895487] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:45,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286581164] [2025-04-29 11:19:45,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:45,005 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:45,007 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:45,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:45,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:19:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:45,174 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:45,184 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,215 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:45,215 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:45,248 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 7 [2025-04-29 11:19:45,256 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|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-04-29 11:19:45,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:45,281 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:45,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:45,369 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:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-04-29 11:19:45,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286581164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:46,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 13 [2025-04-29 11:19:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395194053] [2025-04-29 11:19:46,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:46,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:19:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:46,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:19:46,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=216, Unknown=3, NotChecked=30, Total=306 [2025-04-29 11:19:46,622 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:46,803 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-04-29 11:19:46,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:46,803 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-04-29 11:19:46,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:46,804 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:19:46,804 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:19:46,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=366, Unknown=3, NotChecked=40, Total=506 [2025-04-29 11:19:46,805 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 149 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:46,805 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 171 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 85 Unchecked, 0.1s Time] [2025-04-29 11:19:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:19:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2025-04-29 11:19:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 92 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-04-29 11:19:46,807 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 46 [2025-04-29 11:19:46,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:46,807 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-04-29 11:19:46,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:46,808 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-04-29 11:19:46,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:19:46,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:46,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:46,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:47,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:47,009 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:47,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 562295889, now seen corresponding path program 1 times [2025-04-29 11:19:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:47,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682918798] [2025-04-29 11:19:47,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:47,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:47,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:47,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:47,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:47,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682918798] [2025-04-29 11:19:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682918798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:47,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911016609] [2025-04-29 11:19:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:47,973 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:47,974 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:48,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:48,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:48,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:48,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:48,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-29 11:19:48,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:48,145 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:48,299 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:48,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:19:48,388 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:48,551 INFO L325 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-04-29 11:19:48,551 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 34 treesize of output 24 [2025-04-29 11:19:48,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 11:19:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:48,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:48,934 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 8 treesize of output 4 [2025-04-29 11:19:48,972 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:48,976 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 13 treesize of output 11 [2025-04-29 11:19:48,978 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 20 treesize of output 18 [2025-04-29 11:19:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911016609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:49,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 22] total 63 [2025-04-29 11:19:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013586465] [2025-04-29 11:19:49,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:49,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-29 11:19:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:49,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-29 11:19:49,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3710, Unknown=0, NotChecked=0, Total=3906 [2025-04-29 11:19:49,343 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 55 states have internal predecessors, (109), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:19:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:50,635 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-04-29 11:19:50,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:19:50,636 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 55 states have internal predecessors, (109), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2025-04-29 11:19:50,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:50,636 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:19:50,636 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:19:50,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=396, Invalid=6084, Unknown=0, NotChecked=0, Total=6480 [2025-04-29 11:19:50,639 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 157 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:50,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 857 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:19:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:19:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:19:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 92 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-04-29 11:19:50,642 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 47 [2025-04-29 11:19:50,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:50,642 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-04-29 11:19:50,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 55 states have internal predecessors, (109), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:19:50,642 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-04-29 11:19:50,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:19:50,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:50,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:50,656 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:50,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:50,844 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:50,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 608058032, now seen corresponding path program 1 times [2025-04-29 11:19:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:50,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792780645] [2025-04-29 11:19:50,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:51,602 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:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:51,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792780645] [2025-04-29 11:19:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792780645] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:51,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936601472] [2025-04-29 11:19:51,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:51,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:51,604 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:51,605 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:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:51,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:51,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:51,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:51,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-29 11:19:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:51,982 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:52,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:52,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:19:52,084 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:19:52,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:19:52,316 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 7 treesize of output 3 [2025-04-29 11:19:52,411 INFO L325 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-04-29 11:19:52,411 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 35 [2025-04-29 11:19:52,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 15 treesize of output 7 [2025-04-29 11:19:52,506 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:52,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:52,513 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:19:52,513 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 12 treesize of output 11 [2025-04-29 11:19:52,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 34 treesize of output 22 [2025-04-29 11:19:52,701 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 26 treesize of output 18 [2025-04-29 11:19:52,924 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 104 treesize of output 100 [2025-04-29 11:19:53,076 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:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936601472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:53,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 24] total 56 [2025-04-29 11:19:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467616575] [2025-04-29 11:19:53,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:53,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-29 11:19:53,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:53,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-29 11:19:53,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2966, Unknown=0, NotChecked=0, Total=3192 [2025-04-29 11:19:53,078 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 52 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 11:19:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:53,816 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-04-29 11:19:53,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:19:53,816 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 52 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 48 [2025-04-29 11:19:53,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:53,818 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:53,818 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:53,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=425, Invalid=4405, Unknown=0, NotChecked=0, Total=4830 [2025-04-29 11:19:53,819 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 77 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:53,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 864 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:19:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 95 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-04-29 11:19:53,822 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 48 [2025-04-29 11:19:53,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:53,822 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-04-29 11:19:53,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 52 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 11:19:53,823 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-04-29 11:19:53,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:19:53,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:53,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:53,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:19:54,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:54,024 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:19:54,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 608058033, now seen corresponding path program 1 times [2025-04-29 11:19:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:54,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963091102] [2025-04-29 11:19:54,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:55,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963091102] [2025-04-29 11:19:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963091102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:55,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41421665] [2025-04-29 11:19:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:55,206 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:55,208 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:55,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:55,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:55,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:55,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:55,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-04-29 11:19:55,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:55,428 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:55,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:19:55,692 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:55,693 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:55,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:19:55,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:19:55,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:55,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:19:55,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:55,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-04-29 11:19:56,014 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:19:56,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 11:19:56,025 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:19:56,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 28 [2025-04-29 11:19:56,423 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 7 treesize of output 3 [2025-04-29 11:19:56,496 INFO L325 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-04-29 11:19:56,496 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 46 [2025-04-29 11:19:56,503 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:56,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-29 11:19:56,657 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:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:57,135 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 74 treesize of output 58 [2025-04-29 11:19:57,137 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 46 [2025-04-29 11:19:57,568 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_3020 (Array Int Int)) (v_ArrVal_3017 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3017)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3020) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_3020 (Array Int Int)) (v_ArrVal_3016 Int) (v_ArrVal_3017 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3017)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3020) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 4) (select |c_#length| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3016)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2025-04-29 11:19:57,593 INFO L325 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-04-29 11:19:57,594 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 115 [2025-04-29 11:19:57,599 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 478 treesize of output 470 [2025-04-29 11:19:57,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:57,610 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 380 treesize of output 353 [2025-04-29 11:19:57,617 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 258 treesize of output 242 [2025-04-29 11:19:58,391 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:58,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2025-04-29 11:19:58,393 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:58,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-04-29 11:19:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41421665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:58,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2025-04-29 11:19:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238884045] [2025-04-29 11:19:58,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:58,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:19:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:58,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:19:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4295, Unknown=69, NotChecked=132, Total=4692 [2025-04-29 11:19:58,606 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:20:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:00,563 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-04-29 11:20:00,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:20:00,564 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-04-29 11:20:00,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:00,564 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:20:00,564 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:20:00,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=464, Invalid=7839, Unknown=73, NotChecked=180, Total=8556 [2025-04-29 11:20:00,566 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 108 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:00,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 889 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:20:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:20:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:20:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 95 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-04-29 11:20:00,568 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 48 [2025-04-29 11:20:00,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:00,568 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-04-29 11:20:00,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:20:00,569 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-04-29 11:20:00,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:20:00,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:00,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:00,577 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:20:00,769 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,SelfDestructingSolverStorable32 [2025-04-29 11:20:00,770 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:20:00,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -79284263, now seen corresponding path program 1 times [2025-04-29 11:20:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:00,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208105099] [2025-04-29 11:20:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:20:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:20:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:00,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208105099] [2025-04-29 11:20:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208105099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:00,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767057567] [2025-04-29 11:20:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:00,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:00,882 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:20:00,883 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:20:01,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:20:01,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:20:01,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:01,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:01,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-29 11:20:01,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:01,253 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:20:01,380 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 7 treesize of output 3 [2025-04-29 11:20:01,445 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:20:01,483 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:20:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:01,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:01,655 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 39 treesize of output 27 [2025-04-29 11:20:01,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-04-29 11:20:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767057567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:01,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 15] total 30 [2025-04-29 11:20:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40110757] [2025-04-29 11:20:01,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:01,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:20:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:01,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:20:01,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:20:01,812 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 29 states have internal predecessors, (107), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:20:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:02,320 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2025-04-29 11:20:02,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:20:02,320 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 29 states have internal predecessors, (107), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2025-04-29 11:20:02,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:02,321 INFO L225 Difference]: With dead ends: 130 [2025-04-29 11:20:02,321 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:20:02,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:20:02,322 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:02,322 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 398 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:20:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:20:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2025-04-29 11:20:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 99 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2025-04-29 11:20:02,324 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 53 [2025-04-29 11:20:02,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:02,325 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2025-04-29 11:20:02,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 29 states have internal predecessors, (107), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:20:02,325 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2025-04-29 11:20:02,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:20:02,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:02,325 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, 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:20:02,334 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:20:02,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:02,526 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:20:02,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1838848408, now seen corresponding path program 1 times [2025-04-29 11:20:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:02,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790537597] [2025-04-29 11:20:02,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:02,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:20:02,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:20:02,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:02,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:20:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:02,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790537597] [2025-04-29 11:20:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790537597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:20:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607458652] [2025-04-29 11:20:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:02,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:20:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:20:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:20:02,618 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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:20:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:02,699 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-04-29 11:20:02,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:02,700 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 54 [2025-04-29 11:20:02,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:02,700 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:20:02,700 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:20:02,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:20:02,701 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:02,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 372 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:20:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2025-04-29 11:20:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.25) internal successors, (110), 99 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2025-04-29 11:20:02,703 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 54 [2025-04-29 11:20:02,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:02,703 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2025-04-29 11:20:02,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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:20:02,703 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2025-04-29 11:20:02,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:20:02,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:02,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:20:02,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:20:02,703 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:20:02,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -78924453, now seen corresponding path program 1 times [2025-04-29 11:20:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:02,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68379290] [2025-04-29 11:20:02,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:02,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:20:02,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:20:02,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:02,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:03,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68379290] [2025-04-29 11:20:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68379290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:03,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368523658] [2025-04-29 11:20:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:03,407 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:20:03,407 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:20:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:20:03,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:20:03,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:03,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:03,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-04-29 11:20:03,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:03,753 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:20:03,756 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:20:03,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:03,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:03,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:03,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:03,859 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:20:03,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 11:20:03,871 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-29 11:20:03,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:20:04,290 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:04,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:04,295 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 55 treesize of output 31 [2025-04-29 11:20:04,577 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:04,578 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:04,588 INFO L325 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2025-04-29 11:20:04,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 52 [2025-04-29 11:20:04,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2025-04-29 11:20:04,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-04-29 11:20:05,018 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:20:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:20:05,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:05,177 INFO L325 Elim1Store]: treesize reduction 5, result has 90.0 percent of original size [2025-04-29 11:20:05,178 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 54 treesize of output 53 [2025-04-29 11:20:06,044 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 198 treesize of output 142 [2025-04-29 11:20:06,047 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 146 treesize of output 106 [2025-04-29 11:20:06,490 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 333 treesize of output 321 [2025-04-29 11:20:06,514 INFO L325 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-04-29 11:20:06,514 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 41 [2025-04-29 11:20:06,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:06,528 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 44 treesize of output 45 [2025-04-29 11:20:06,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:20:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368523658] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:06,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 32, 31] total 72 [2025-04-29 11:20:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307437945] [2025-04-29 11:20:06,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:06,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-04-29 11:20:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:06,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-04-29 11:20:06,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=4929, Unknown=4, NotChecked=0, Total=5256 [2025-04-29 11:20:06,965 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 73 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 68 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:20:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:09,532 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2025-04-29 11:20:09,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-29 11:20:09,533 INFO L79 Accepts]: Start accepts. Automaton has has 73 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 68 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2025-04-29 11:20:09,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:09,534 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:20:09,534 INFO L226 Difference]: Without dead ends: 118 [2025-04-29 11:20:09,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=816, Invalid=8686, Unknown=4, NotChecked=0, Total=9506 [2025-04-29 11:20:09,536 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 194 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:09,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 826 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-29 11:20:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-29 11:20:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2025-04-29 11:20:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.223529411764706) internal successors, (104), 96 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-04-29 11:20:09,540 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 57 [2025-04-29 11:20:09,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:09,541 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-04-29 11:20:09,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 68 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:20:09,541 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-04-29 11:20:09,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:20:09,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:09,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:20:09,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:20:09,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:09,742 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-04-29 11:20:09,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash -78924452, now seen corresponding path program 1 times [2025-04-29 11:20:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:09,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817891089] [2025-04-29 11:20:09,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:09,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:20:09,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:20:09,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:09,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:12,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817891089] [2025-04-29 11:20:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817891089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:12,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417699506] [2025-04-29 11:20:12,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:12,255 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:20:12,263 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:20:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:20:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:20:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:12,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-04-29 11:20:12,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:12,760 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:20:12,764 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:20:12,806 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:20:12,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:13,190 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:20:13,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:20:13,204 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:13,205 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:20:13,209 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 12 treesize of output 14 [2025-04-29 11:20:13,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:20:13,379 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 19 treesize of output 11 [2025-04-29 11:20:13,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:20:13,497 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 36 treesize of output 27 [2025-04-29 11:20:13,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:13,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-04-29 11:20:13,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:20:14,545 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 11:20:14,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 66 [2025-04-29 11:20:14,550 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 27 treesize of output 22 [2025-04-29 11:20:14,722 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-29 11:20:14,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 72 [2025-04-29 11:20:14,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 25 [2025-04-29 11:20:14,942 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 77 treesize of output 45 [2025-04-29 11:20:15,037 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:20:15,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 29 [2025-04-29 11:20:15,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:20:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:15,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:17,722 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 490 treesize of output 366 [2025-04-29 11:20:17,724 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 370 treesize of output 270 [2025-04-29 11:20:18,277 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (and (forall ((v_prenex_6 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| Int) (v_ArrVal_3610 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3610 .cse3 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_prenex_6))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) 8) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 .cse1)))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3))))) (forall ((v_ArrVal_3610 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3610 .cse3 .cse7)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset|)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) 4)))))) is different from false [2025-04-29 11:20:18,296 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse11 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_3606 Int) (v_ArrVal_3610 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3606)))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3610 .cse4 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4) 4))) (forall ((v_prenex_6 Int) (v_ArrVal_3606 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| Int) (v_ArrVal_3610 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3606)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (<= (+ (select (select (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3610 .cse4 .cse7)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 v_prenex_6))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4) 8) (select |c_#length| (select (select (let ((.cse9 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse11 .cse4 .cse1)))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse7 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4)))))))))) is different from false [2025-04-29 11:20:18,330 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse7 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_prenex_6 Int) (v_ArrVal_3606 Int) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base| Int) (v_ArrVal_3610 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3606)))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (<= (+ (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3610 .cse4 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_prenex_6))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 8) (select |c_#length| (select (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse7 .cse4 .cse1)))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))))) (forall ((v_ArrVal_3606 Int) (v_ArrVal_3610 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3606)))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3610) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3610 .cse4 .cse10)))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse10 |ULTIMATE.start_dll_circular_remove_last_#t~mem10#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 4))))))) is different from false [2025-04-29 11:20:18,343 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 5743 treesize of output 5687 Killed by 15