./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0234-2.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/memsafety/test-0234-2.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 1f9a9477fb0ef7ace9239ad0b6ac943e6d6a54e93fd3c1fee502103994a0685f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:24:54,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:24:54,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:24:54,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:24:54,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:24:54,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:24:54,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:24:54,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:24:54,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:24:54,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:24:54,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:24:54,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:24:54,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:24:54,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:24:54,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:24:54,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:24:54,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:54,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:54,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:54,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:24:54,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:24:54,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:24:54,143 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 -> 1f9a9477fb0ef7ace9239ad0b6ac943e6d6a54e93fd3c1fee502103994a0685f [2025-04-29 11:24:54,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:24:54,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:24:54,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:24:54,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:24:54,352 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:24:54,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234-2.c [2025-04-29 11:24:55,600 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7145295b5/5d56040a77a340e0845c26285c6f5425/FLAG062dbca2f [2025-04-29 11:24:55,806 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:55,806 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0234-2.c [2025-04-29 11:24:55,807 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:55,810 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:55,810 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:55,816 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7145295b5/5d56040a77a340e0845c26285c6f5425/FLAG062dbca2f [2025-04-29 11:24:56,651 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7145295b5/5d56040a77a340e0845c26285c6f5425 [2025-04-29 11:24:56,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:56,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:56,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:56,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:56,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:56,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d421526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56, skipping insertion in model container [2025-04-29 11:24:56,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:56,835 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:56,847 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:56,874 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:56,887 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:56,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56 WrapperNode [2025-04-29 11:24:56,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:56,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:56,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:56,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:56,894 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:24:56" (1/1) ... [2025-04-29 11:24:56,902 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:24:56" (1/1) ... [2025-04-29 11:24:56,929 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 192 [2025-04-29 11:24:56,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:56,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:56,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:56,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:56,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,963 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [4, 24]. 86 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 12 writes are split as follows [1, 11]. [2025-04-29 11:24:56,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:24:56,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:24:56,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:24:56,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:24:56,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (1/1) ... [2025-04-29 11:24:56,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:57,025 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:24:57,030 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:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-29 11:24:57,045 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:24:57,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:24:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:24:57,143 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:24:57,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:24:57,535 INFO L? ?]: Removed 190 outVars from TransFormulas that were not future-live. [2025-04-29 11:24:57,535 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:24:57,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:24:57,543 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-29 11:24:57,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:57 BoogieIcfgContainer [2025-04-29 11:24:57,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:24:57,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:24:57,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:24:57,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:24:57,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:56" (1/3) ... [2025-04-29 11:24:57,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7742373d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:57, skipping insertion in model container [2025-04-29 11:24:57,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:56" (2/3) ... [2025-04-29 11:24:57,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7742373d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:57, skipping insertion in model container [2025-04-29 11:24:57,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:57" (3/3) ... [2025-04-29 11:24:57,552 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0234-2.c [2025-04-29 11:24:57,563 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:24:57,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0234-2.c that has 2 procedures, 177 locations, 209 edges, 1 initial locations, 11 loop locations, and 70 error locations. [2025-04-29 11:24:57,598 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:24:57,607 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;@60870ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:24:57,607 INFO L341 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-04-29 11:24:57,611 INFO L278 IsEmpty]: Start isEmpty. Operand has 177 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 169 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:24:57,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:24:57,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:57,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:24:57,615 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:24:57,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 929958, now seen corresponding path program 1 times [2025-04-29 11:24:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:57,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781227549] [2025-04-29 11:24:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:57,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:24:57,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:24:57,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:57,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:57,694 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:24:57,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:57,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781227549] [2025-04-29 11:24:57,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781227549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:57,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:57,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:57,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863979432] [2025-04-29 11:24:57,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:57,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:24:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:57,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:24:57,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:57,717 INFO L87 Difference]: Start difference. First operand has 177 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 169 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:57,740 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2025-04-29 11:24:57,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:24:57,741 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:24:57,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:57,748 INFO L225 Difference]: With dead ends: 177 [2025-04-29 11:24:57,748 INFO L226 Difference]: Without dead ends: 175 [2025-04-29 11:24:57,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:57,752 INFO L437 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:57,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-29 11:24:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-04-29 11:24:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 98 states have (on average 1.816326530612245) internal successors, (178), 167 states have internal predecessors, (178), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:24:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2025-04-29 11:24:57,798 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 4 [2025-04-29 11:24:57,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:57,798 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2025-04-29 11:24:57,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:57,799 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2025-04-29 11:24:57,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:24:57,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:57,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:24:57,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:24:57,800 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:24:57,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 889828716, now seen corresponding path program 1 times [2025-04-29 11:24:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:57,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140991999] [2025-04-29 11:24:57,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:24:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:24:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:57,882 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:24:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:57,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140991999] [2025-04-29 11:24:57,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140991999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:57,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:57,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:57,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085852283] [2025-04-29 11:24:57,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:57,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:57,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:57,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:57,884 INFO L87 Difference]: Start difference. First operand 175 states and 190 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:24:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:57,979 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2025-04-29 11:24:57,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:57,979 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:24:57,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:57,980 INFO L225 Difference]: With dead ends: 174 [2025-04-29 11:24:57,980 INFO L226 Difference]: Without dead ends: 174 [2025-04-29 11:24:57,981 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:24:57,981 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:57,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-29 11:24:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-04-29 11:24:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 98 states have (on average 1.8061224489795917) internal successors, (177), 166 states have internal predecessors, (177), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:24:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2025-04-29 11:24:57,989 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 6 [2025-04-29 11:24:57,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:57,990 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2025-04-29 11:24:57,990 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:24:57,990 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2025-04-29 11:24:57,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:57,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:57,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:57,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:24:57,990 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:24:57,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1814886736, now seen corresponding path program 1 times [2025-04-29 11:24:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:57,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372137731] [2025-04-29 11:24:57,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:58,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:58,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:24:58,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434912041] [2025-04-29 11:24:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:58,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:58,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:58,029 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:24:58,030 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:24:58,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:58,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:58,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:58,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:58,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:24:58,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:58,127 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:24:58,141 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:24:58,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:58,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372137731] [2025-04-29 11:24:58,142 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:24:58,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434912041] [2025-04-29 11:24:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434912041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519309138] [2025-04-29 11:24:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:58,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:58,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:58,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:58,143 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:58,241 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-04-29 11:24:58,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:58,242 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-04-29 11:24:58,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:58,243 INFO L225 Difference]: With dead ends: 183 [2025-04-29 11:24:58,243 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 11:24:58,243 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:24:58,243 INFO L437 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:58,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 480 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 11:24:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-04-29 11:24:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.7547169811320755) internal successors, (186), 174 states have internal predecessors, (186), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:24:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2025-04-29 11:24:58,254 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 7 [2025-04-29 11:24:58,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:58,255 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2025-04-29 11:24:58,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:24:58,255 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2025-04-29 11:24:58,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:24:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:58,256 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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:24:58,262 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:24:58,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:58,460 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:24:58,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1349329703, now seen corresponding path program 1 times [2025-04-29 11:24:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:58,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479619521] [2025-04-29 11:24:58,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:24:58,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:24:58,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:58,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:24:58,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968935585] [2025-04-29 11:24:58,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:58,537 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:24:58,539 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:24:58,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:24:58,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:24:58,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:58,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:58,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-29 11:24:58,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:58,702 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 7 [2025-04-29 11:24:58,741 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 13 treesize of output 9 [2025-04-29 11:24:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:24:58,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:58,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479619521] [2025-04-29 11:24:58,795 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:24:58,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968935585] [2025-04-29 11:24:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968935585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31848013] [2025-04-29 11:24:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:58,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:58,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:58,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:58,796 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:24:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:58,905 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2025-04-29 11:24:58,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:24:58,906 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-04-29 11:24:58,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:58,907 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:24:58,907 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:24:58,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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:24:58,908 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 3 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:58,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 660 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:24:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-29 11:24:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 176 states have internal predecessors, (188), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:24:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2025-04-29 11:24:58,921 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 66 [2025-04-29 11:24:58,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:58,921 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2025-04-29 11:24:58,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:24:58,921 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2025-04-29 11:24:58,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 11:24:58,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:58,922 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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:24:58,930 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:24:59,122 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,SelfDestructingSolverStorable3 [2025-04-29 11:24:59,123 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:24:59,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -545319389, now seen corresponding path program 1 times [2025-04-29 11:24:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:59,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106771070] [2025-04-29 11:24:59,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:59,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:24:59,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:24:59,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:59,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:24:59,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965939089] [2025-04-29 11:24:59,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:59,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:59,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:59,286 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:24:59,287 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:24:59,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:24:59,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:24:59,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:59,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:59,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:24:59,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:59,486 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:24:59,510 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 13 treesize of output 9 [2025-04-29 11:24:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-04-29 11:24:59,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-29 11:24:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:59,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106771070] [2025-04-29 11:24:59,719 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:24:59,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965939089] [2025-04-29 11:24:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965939089] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:59,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-04-29 11:24:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125586762] [2025-04-29 11:24:59,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:59,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:59,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:59,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:59,721 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 11:24:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:59,991 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2025-04-29 11:24:59,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:24:59,991 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-04-29 11:24:59,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:59,992 INFO L225 Difference]: With dead ends: 204 [2025-04-29 11:24:59,992 INFO L226 Difference]: Without dead ends: 189 [2025-04-29 11:24:59,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:24:59,993 INFO L437 NwaCegarLoop]: 183 mSDtfsCounter, 13 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:59,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 787 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-29 11:24:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-04-29 11:24:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 112 states have (on average 1.7142857142857142) internal successors, (192), 180 states have internal predecessors, (192), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2025-04-29 11:25:00,000 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 71 [2025-04-29 11:25:00,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:00,000 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2025-04-29 11:25:00,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 11:25:00,000 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2025-04-29 11:25:00,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-29 11:25:00,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:00,005 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 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:25:00,014 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:25:00,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:00,208 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:00,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash -91152857, now seen corresponding path program 2 times [2025-04-29 11:25:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:00,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009098008] [2025-04-29 11:25:00,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:00,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:00,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:00,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:00,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:00,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060201287] [2025-04-29 11:25:00,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:00,353 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:25:00,355 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:25:00,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:00,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:00,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:00,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:25:00,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:00,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:25:00,647 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 13 treesize of output 9 [2025-04-29 11:25:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-04-29 11:25:00,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-04-29 11:25:01,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:01,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009098008] [2025-04-29 11:25:01,003 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:01,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060201287] [2025-04-29 11:25:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060201287] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:01,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-04-29 11:25:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655861177] [2025-04-29 11:25:01,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:01,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:25:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:01,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:25:01,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:25:01,005 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:01,536 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2025-04-29 11:25:01,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:25:01,540 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-04-29 11:25:01,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:01,541 INFO L225 Difference]: With dead ends: 211 [2025-04-29 11:25:01,541 INFO L226 Difference]: Without dead ends: 196 [2025-04-29 11:25:01,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:25:01,543 INFO L437 NwaCegarLoop]: 183 mSDtfsCounter, 29 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:01,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2387 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-29 11:25:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-04-29 11:25:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.6722689075630253) internal successors, (199), 187 states have internal predecessors, (199), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2025-04-29 11:25:01,550 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 86 [2025-04-29 11:25:01,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:01,550 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2025-04-29 11:25:01,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:01,550 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2025-04-29 11:25:01,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-04-29 11:25:01,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:01,551 INFO L218 NwaCegarLoop]: trace histogram [40, 6, 6, 5, 5, 5, 5, 5, 5, 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:25:01,565 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:25:01,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:01,752 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:01,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1910282535, now seen corresponding path program 3 times [2025-04-29 11:25:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:01,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739492092] [2025-04-29 11:25:01,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:25:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:01,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-29 11:25:02,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:25:02,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-04-29 11:25:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:02,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747573055] [2025-04-29 11:25:02,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:25:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:02,230 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:25:02,232 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:25:02,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-29 11:25:02,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-04-29 11:25:02,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:25:02,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:02,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:25:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:02,363 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:25:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-04-29 11:25:02,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:02,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739492092] [2025-04-29 11:25:02,376 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:02,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747573055] [2025-04-29 11:25:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747573055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806298748] [2025-04-29 11:25:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:02,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:02,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:02,377 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:02,457 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2025-04-29 11:25:02,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:02,458 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 106 [2025-04-29 11:25:02,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:02,459 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:25:02,459 INFO L226 Difference]: Without dead ends: 195 [2025-04-29 11:25:02,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:25:02,459 INFO L437 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:02,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 502 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-29 11:25:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-04-29 11:25:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 186 states have internal predecessors, (198), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2025-04-29 11:25:02,467 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 106 [2025-04-29 11:25:02,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:02,467 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2025-04-29 11:25:02,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:02,467 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2025-04-29 11:25:02,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-29 11:25:02,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:02,468 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 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:25:02,476 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:25:02,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:02,669 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:02,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 947433240, now seen corresponding path program 1 times [2025-04-29 11:25:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:02,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206460786] [2025-04-29 11:25:02,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:02,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:02,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:02,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:02,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-04-29 11:25:03,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:03,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206460786] [2025-04-29 11:25:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206460786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:03,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931576053] [2025-04-29 11:25:03,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:03,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:03,523 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:25:03,524 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:25:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:03,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:25:03,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:03,796 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:03,839 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:03,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 1 refuted. 0 times theorem prover too weak. 733 trivial. 60 not checked. [2025-04-29 11:25:03,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:04,049 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:04,050 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:25:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-04-29 11:25:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931576053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:04,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-04-29 11:25:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967833563] [2025-04-29 11:25:04,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:04,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:25:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:04,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:25:04,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:25:04,068 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:04,461 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2025-04-29 11:25:04,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:25:04,461 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2025-04-29 11:25:04,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:04,462 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:25:04,462 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:25:04,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2025-04-29 11:25:04,463 INFO L437 NwaCegarLoop]: 169 mSDtfsCounter, 17 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:04,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1263 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 731 Invalid, 0 Unknown, 178 Unchecked, 0.3s Time] [2025-04-29 11:25:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:25:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-29 11:25:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2025-04-29 11:25:04,467 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 118 [2025-04-29 11:25:04,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:04,468 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2025-04-29 11:25:04,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:04,468 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2025-04-29 11:25:04,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-29 11:25:04,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:04,472 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 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:25:04,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:04,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:04,672 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:04,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 947433241, now seen corresponding path program 1 times [2025-04-29 11:25:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:04,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123149940] [2025-04-29 11:25:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:04,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:04,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:04,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 97 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-04-29 11:25:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:06,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123149940] [2025-04-29 11:25:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123149940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:06,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159636348] [2025-04-29 11:25:06,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:06,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:06,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:06,354 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:25:06,356 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:25:06,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:06,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:06,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:06,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:06,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-04-29 11:25:06,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:06,988 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 10 treesize of output 9 [2025-04-29 11:25:08,490 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:08,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:08,540 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:25:08,550 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:08,551 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:25:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 398 proven. 562 refuted. 0 times theorem prover too weak. 284 trivial. 151 not checked. [2025-04-29 11:25:08,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159636348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:08,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2025-04-29 11:25:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083190477] [2025-04-29 11:25:08,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:08,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:25:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:08,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:25:08,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2195, Unknown=1, NotChecked=94, Total=2450 [2025-04-29 11:25:08,775 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:25:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:12,084 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2025-04-29 11:25:12,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:25:12,084 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-04-29 11:25:12,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:12,086 INFO L225 Difference]: With dead ends: 223 [2025-04-29 11:25:12,086 INFO L226 Difference]: Without dead ends: 223 [2025-04-29 11:25:12,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=344, Invalid=4351, Unknown=1, NotChecked=134, Total=4830 [2025-04-29 11:25:12,088 INFO L437 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:12,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3448 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2775 Invalid, 0 Unknown, 197 Unchecked, 2.0s Time] [2025-04-29 11:25:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-29 11:25:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 191. [2025-04-29 11:25:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 119 states have (on average 1.6302521008403361) internal successors, (194), 182 states have internal predecessors, (194), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2025-04-29 11:25:12,093 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 118 [2025-04-29 11:25:12,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:12,093 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2025-04-29 11:25:12,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 43 states have internal predecessors, (84), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:25:12,093 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2025-04-29 11:25:12,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-04-29 11:25:12,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:12,094 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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:25:12,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:25:12,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:12,298 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:12,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -49722887, now seen corresponding path program 1 times [2025-04-29 11:25:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:12,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352099781] [2025-04-29 11:25:12,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:12,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:12,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 776 proven. 153 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-04-29 11:25:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:13,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352099781] [2025-04-29 11:25:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352099781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:13,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598105693] [2025-04-29 11:25:13,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:13,168 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:25:13,169 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:25:13,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:13,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:13,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:25:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:13,483 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:13,518 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:13,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:13,559 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:13,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:25:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 2 refuted. 0 times theorem prover too weak. 527 trivial. 147 not checked. [2025-04-29 11:25:13,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:13,895 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:13,895 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:25:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 149 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-29 11:25:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598105693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:13,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 23 [2025-04-29 11:25:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136227768] [2025-04-29 11:25:13,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:13,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:25:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:25:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-04-29 11:25:13,909 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-04-29 11:25:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:14,534 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2025-04-29 11:25:14,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:14,534 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 120 [2025-04-29 11:25:14,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:14,535 INFO L225 Difference]: With dead ends: 188 [2025-04-29 11:25:14,535 INFO L226 Difference]: Without dead ends: 188 [2025-04-29 11:25:14,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 230 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2025-04-29 11:25:14,536 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 30 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:14,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1870 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1262 Invalid, 0 Unknown, 173 Unchecked, 0.5s Time] [2025-04-29 11:25:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-29 11:25:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-04-29 11:25:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 119 states have (on average 1.6050420168067228) internal successors, (191), 179 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2025-04-29 11:25:14,541 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 120 [2025-04-29 11:25:14,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:14,542 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2025-04-29 11:25:14,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-04-29 11:25:14,542 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2025-04-29 11:25:14,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-04-29 11:25:14,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:14,544 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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:25:14,553 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:25:14,745 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,SelfDestructingSolverStorable9 [2025-04-29 11:25:14,745 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:14,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash -49722886, now seen corresponding path program 1 times [2025-04-29 11:25:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:14,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169892597] [2025-04-29 11:25:14,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:14,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:14,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:14,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:14,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 246 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-04-29 11:25:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:16,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169892597] [2025-04-29 11:25:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169892597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:16,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382133403] [2025-04-29 11:25:16,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:16,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:16,246 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:25:16,247 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:25:16,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:16,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-04-29 11:25:16,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:17,004 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 10 treesize of output 9 [2025-04-29 11:25:27,650 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|))) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:27,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:27,734 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:25:27,743 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:25:27,743 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:25:27,772 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:28,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:28,131 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:25:28,140 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:28,140 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:25:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 609 proven. 287 refuted. 0 times theorem prover too weak. 298 trivial. 201 not checked. [2025-04-29 11:25:28,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382133403] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:28,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31] total 52 [2025-04-29 11:25:28,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231931592] [2025-04-29 11:25:28,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:28,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:25:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:28,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:25:28,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2596, Unknown=3, NotChecked=206, Total=2970 [2025-04-29 11:25:28,423 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 53 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 50 states have internal predecessors, (107), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2025-04-29 11:25:32,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:36,914 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:41,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:45,656 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:50,152 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:55,063 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:59,216 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2025-04-29 11:25:59,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:25:59,216 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 50 states have internal predecessors, (107), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) Word has length 120 [2025-04-29 11:25:59,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:59,217 INFO L225 Difference]: With dead ends: 198 [2025-04-29 11:25:59,217 INFO L226 Difference]: Without dead ends: 198 [2025-04-29 11:25:59,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=393, Invalid=5162, Unknown=3, NotChecked=294, Total=5852 [2025-04-29 11:25:59,218 INFO L437 NwaCegarLoop]: 155 mSDtfsCounter, 61 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:59,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3139 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2811 Invalid, 5 Unknown, 363 Unchecked, 26.1s Time] [2025-04-29 11:25:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-04-29 11:25:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2025-04-29 11:25:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 119 states have (on average 1.5798319327731092) internal successors, (188), 176 states have internal predecessors, (188), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:25:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2025-04-29 11:25:59,223 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 120 [2025-04-29 11:25:59,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:59,223 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2025-04-29 11:25:59,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 50 states have internal predecessors, (107), 3 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2025-04-29 11:25:59,223 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2025-04-29 11:25:59,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-04-29 11:25:59,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:59,224 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,238 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:25:59,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:59,425 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:25:59,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2135957755, now seen corresponding path program 1 times [2025-04-29 11:25:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:59,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760934555] [2025-04-29 11:25:59,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:59,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-29 11:25:59,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-29 11:25:59,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:59,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 830 proven. 188 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-04-29 11:26:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:00,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760934555] [2025-04-29 11:26:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760934555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:00,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892026680] [2025-04-29 11:26:00,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:00,508 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:26:00,508 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:26:00,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-29 11:26:00,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-29 11:26:00,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:00,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:00,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 11:26:00,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:00,925 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-04-29 11:26:00,927 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-04-29 11:26:00,938 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2025-04-29 11:26:00,940 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2025-04-29 11:26:00,957 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-04-29 11:26:00,959 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-04-29 11:26:01,062 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-04-29 11:26:01,065 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse1) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_51| .cse1))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-04-29 11:26:01,122 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from false [2025-04-29 11:26:01,125 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |c_#valid| .cse0)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |c_#valid| .cse2))))))) is different from true [2025-04-29 11:26:01,165 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:26:01,219 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:26:01,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:26:01,325 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from false [2025-04-29 11:26:01,328 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) is different from true [2025-04-29 11:26:01,435 WARN L849 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from false [2025-04-29 11:26:01,439 WARN L871 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from true [2025-04-29 11:26:01,667 WARN L849 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from false [2025-04-29 11:26:01,672 WARN L871 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) is different from true [2025-04-29 11:26:01,910 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_2618 Int)) (= (select |c_#valid| v_ArrVal_2618) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse3))) is different from false [2025-04-29 11:26:01,916 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_2618 Int)) (= (select |c_#valid| v_ArrVal_2618) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse4) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse5) 1)))) .cse3))) is different from true [2025-04-29 11:26:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 659 proven. 179 refuted. 0 times theorem prover too weak. 377 trivial. 180 not checked. [2025-04-29 11:26:02,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:02,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892026680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:02,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:26:02,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 33 [2025-04-29 11:26:02,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139705878] [2025-04-29 11:26:02,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:02,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:26:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:02,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:26:02,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=624, Unknown=19, NotChecked=590, Total=1332 [2025-04-29 11:26:02,157 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand has 34 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 27 states have internal predecessors, (84), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:26:02,463 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from false [2025-04-29 11:26:02,469 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse1)) is different from true [2025-04-29 11:26:02,472 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from false [2025-04-29 11:26:02,474 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from true [2025-04-29 11:26:02,477 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from false [2025-04-29 11:26:02,479 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0))) is different from true [2025-04-29 11:26:02,498 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4)))))) .cse0))) is different from false [2025-04-29 11:26:02,502 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse2) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .cse2))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_l4_insert_#t~ret3#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |c_#valid| .cse4)))))) .cse0))) is different from true [2025-04-29 11:26:02,531 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))))) is different from false [2025-04-29 11:26:02,534 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |c_#valid| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_17| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_51| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse4) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_51| .cse4))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_51| .cse3 (select |c_#valid| .cse3))))))))) is different from true [2025-04-29 11:26:02,580 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-04-29 11:26:02,584 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-04-29 11:26:02,676 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-04-29 11:26:02,679 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_old(#valid)_AFTER_CALL_51| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (exists ((|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |c_ULTIMATE.start_l4_insert_~list#1.base| .cse3) (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse4 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-04-29 11:26:02,734 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5))) .cse5)) is different from false [2025-04-29 11:26:02,737 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_52| .cse0)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse2) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse2 (select |v_old(#valid)_AFTER_CALL_52| .cse2)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_old(#valid)_AFTER_CALL_51| .cse3))) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse4 (select |v_old(#valid)_AFTER_CALL_52| .cse4)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5))) .cse5)) is different from true [2025-04-29 11:26:02,806 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((v_ArrVal_2618 Int)) (= (select |c_#valid| v_ArrVal_2618) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse3))) .cse4)) is different from false [2025-04-29 11:26:02,809 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse2 (exists ((v_ArrVal_2618 Int)) (= (select |c_#valid| v_ArrVal_2618) 1))) (.cse3 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |v_old(#valid)_AFTER_CALL_51| (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_old(#valid)_AFTER_CALL_51| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse1 (select |v_old(#valid)_AFTER_CALL_52| .cse1)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3 .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (select |c_#valid| .cse5) 1) (= (store |v_#valid_BEFORE_CALL_17| .cse5 (select |v_old(#valid)_AFTER_CALL_52| .cse5)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)))) .cse2) (and (exists ((|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_51| |v_old(#valid)_AFTER_CALL_52|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_52| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_old(#valid)_AFTER_CALL_51| .cse6 (select |v_old(#valid)_AFTER_CALL_52| .cse6)) |v_old(#valid)_AFTER_CALL_52|) (= (select |v_old(#valid)_AFTER_CALL_51| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse6) 1)))) .cse3))) .cse4)) is different from true [2025-04-29 11:26:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:03,443 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2025-04-29 11:26:03,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:26:03,443 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 27 states have internal predecessors, (84), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 126 [2025-04-29 11:26:03,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:03,444 INFO L225 Difference]: With dead ends: 204 [2025-04-29 11:26:03,444 INFO L226 Difference]: Without dead ends: 204 [2025-04-29 11:26:03,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=153, Invalid=878, Unknown=37, NotChecked=1482, Total=2550 [2025-04-29 11:26:03,445 INFO L437 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 3808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2407 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:03,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2011 Invalid, 3808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1353 Invalid, 0 Unknown, 2407 Unchecked, 0.8s Time] [2025-04-29 11:26:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-29 11:26:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-04-29 11:26:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 135 states have (on average 1.5333333333333334) internal successors, (207), 192 states have internal predecessors, (207), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-04-29 11:26:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2025-04-29 11:26:03,452 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 126 [2025-04-29 11:26:03,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:03,453 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2025-04-29 11:26:03,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 27 states have internal predecessors, (84), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:26:03,453 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2025-04-29 11:26:03,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-04-29 11:26:03,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:03,453 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:03,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:26:03,654 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,SelfDestructingSolverStorable11 [2025-04-29 11:26:03,654 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2025-04-29 11:26:03,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2135957754, now seen corresponding path program 1 times [2025-04-29 11:26:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:03,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607153417] [2025-04-29 11:26:03,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-29 11:26:03,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-29 11:26:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15