./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0234-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/memsafety/test-0234-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:48:40,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:48:40,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:48:40,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:48:40,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:48:40,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:48:40,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:48:40,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:48:40,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:48:40,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:48:40,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:48:40,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:48:40,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:48:40,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:48:40,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:48:40,659 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:48:40,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:40,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:48:40,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:48:40,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:48:40,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:48:40,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:48:40,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:48:40,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:48:40,661 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 -> 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c [2025-03-08 22:48:40,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:48:40,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:48:40,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:48:40,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:48:40,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:48:40,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0234-1.i [2025-03-08 22:48:42,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fae8c6c/9b9c73953f9c4f5882784f4b02a0faf1/FLAG5bf054806 [2025-03-08 22:48:42,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:48:42,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0234-1.i [2025-03-08 22:48:42,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fae8c6c/9b9c73953f9c4f5882784f4b02a0faf1/FLAG5bf054806 [2025-03-08 22:48:42,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fae8c6c/9b9c73953f9c4f5882784f4b02a0faf1 [2025-03-08 22:48:42,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:48:42,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:48:42,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:42,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:48:42,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:48:42,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42, skipping insertion in model container [2025-03-08 22:48:42,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:42,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:42,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:48:42,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:42,952 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:48:42,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42 WrapperNode [2025-03-08 22:48:42,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:42,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:42,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:48:42,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:48:42,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,981 INFO L138 Inliner]: procedures = 188, calls = 60, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 203 [2025-03-08 22:48:42,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:42,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:48:42,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:48:42,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:48:42,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:42,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,011 INFO L175 MemorySlicer]: Split 32 memory accesses to 3 slices as follows [2, 4, 26]. 81 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2025-03-08 22:48:43,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:48:43,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:48:43,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:48:43,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:48:43,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (1/1) ... [2025-03-08 22:48:43,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:43,050 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-03-08 22:48:43,053 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-03-08 22:48:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:48:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:48:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-08 22:48:43,070 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:48:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:48:43,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:48:43,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:48:43,171 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:48:43,246 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-03-08 22:48:43,528 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2025-03-08 22:48:43,528 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:48:43,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:48:43,541 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:48:43,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:43 BoogieIcfgContainer [2025-03-08 22:48:43,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:48:43,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:48:43,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:48:43,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:48:43,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:48:42" (1/3) ... [2025-03-08 22:48:43,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a1891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:43, skipping insertion in model container [2025-03-08 22:48:43,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:42" (2/3) ... [2025-03-08 22:48:43,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a1891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:43, skipping insertion in model container [2025-03-08 22:48:43,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:43" (3/3) ... [2025-03-08 22:48:43,550 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0234-1.i [2025-03-08 22:48:43,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:48:43,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0234-1.i that has 2 procedures, 186 locations, 1 initial locations, 11 loop locations, and 75 error locations. [2025-03-08 22:48:43,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:48:43,604 INFO L333 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;@2d3d9ea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:48:43,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-03-08 22:48:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 103 states have (on average 1.941747572815534) internal successors, (200), 178 states have internal predecessors, (200), 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-03-08 22:48:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:48:43,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:48:43,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 7325477, now seen corresponding path program 1 times [2025-03-08 22:48:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-08 22:48:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:48:43,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:48:43,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-08 22:48:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954689060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603666649] [2025-03-08 22:48:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:48:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:48:43,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:43,755 INFO L87 Difference]: Start difference. First operand has 186 states, 103 states have (on average 1.941747572815534) internal successors, (200), 178 states have internal predecessors, (200), 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-03-08 22:48:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,770 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2025-03-08 22:48:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:48:43,771 INFO L78 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-03-08 22:48:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,775 INFO L225 Difference]: With dead ends: 186 [2025-03-08 22:48:43,775 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 22:48:43,776 INFO L434 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-03-08 22:48:43,777 INFO L435 NwaCegarLoop]: 201 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, 201 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-03-08 22:48:43,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 22:48:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-08 22:48:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 102 states have (on average 1.8333333333333333) internal successors, (187), 176 states have internal predecessors, (187), 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-03-08 22:48:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2025-03-08 22:48:43,806 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 4 [2025-03-08 22:48:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,806 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2025-03-08 22:48:43,806 INFO L472 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-03-08 22:48:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2025-03-08 22:48:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:48:43,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:48:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:48:43,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1550079634, now seen corresponding path program 1 times [2025-03-08 22:48:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-03-08 22:48:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:48:43,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:48:43,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-03-08 22:48:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141282132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180250949] [2025-03-08 22:48:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:43,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:43,928 INFO L87 Difference]: Start difference. First operand 184 states and 199 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-03-08 22:48:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,034 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-03-08 22:48:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:44,034 INFO L78 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-03-08 22:48:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,035 INFO L225 Difference]: With dead ends: 183 [2025-03-08 22:48:44,035 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 22:48:44,035 INFO L434 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-03-08 22:48:44,036 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 315 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 22:48:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-08 22:48:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 175 states have internal predecessors, (186), 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-03-08 22:48:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2025-03-08 22:48:44,044 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 6 [2025-03-08 22:48:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,044 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2025-03-08 22:48:44,044 INFO L472 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-03-08 22:48:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2025-03-08 22:48:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:48:44,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:44,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:48:44,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:44,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -807828418, now seen corresponding path program 1 times [2025-03-08 22:48:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-03-08 22:48:44,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:48:44,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:48:44,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:48:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208791508] [2025-03-08 22:48:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:44,065 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-03-08 22:48:44,067 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-03-08 22:48:44,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:48:44,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:48:44,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:48:44,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:44,195 INFO L378 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-03-08 22:48:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:44,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147174071] [2025-03-08 22:48:44,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:48:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208791508] [2025-03-08 22:48:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446524802] [2025-03-08 22:48:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:44,216 INFO L87 Difference]: Start difference. First operand 183 states and 198 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-03-08 22:48:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,333 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2025-03-08 22:48:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:44,334 INFO L78 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-03-08 22:48:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,335 INFO L225 Difference]: With dead ends: 192 [2025-03-08 22:48:44,335 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 22:48:44,335 INFO L434 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-03-08 22:48:44,335 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 22:48:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-08 22:48:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 183 states have internal predecessors, (195), 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-03-08 22:48:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2025-03-08 22:48:44,344 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 7 [2025-03-08 22:48:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,344 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2025-03-08 22:48:44,344 INFO L472 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-03-08 22:48:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2025-03-08 22:48:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 22:48:44,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,345 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-03-08 22:48:44,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:48:44,545 WARN L453 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-03-08 22:48:44,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:44,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1022075372, now seen corresponding path program 1 times [2025-03-08 22:48:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-08 22:48:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:44,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:48:44,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:48:44,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:48:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14434161] [2025-03-08 22:48:44,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:44,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:44,635 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-03-08 22:48:44,639 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-03-08 22:48:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:48:44,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:48:44,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 22:48:44,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 22:48:44,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-08 22:48:44,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:48:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14434161] [2025-03-08 22:48:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14434161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880788667] [2025-03-08 22:48:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:44,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:44,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:44,864 INFO L87 Difference]: Start difference. First operand 192 states and 207 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-03-08 22:48:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,896 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2025-03-08 22:48:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:44,896 INFO L78 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-03-08 22:48:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,897 INFO L225 Difference]: With dead ends: 204 [2025-03-08 22:48:44,897 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 22:48:44,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:44,898 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 2 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 567 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 22:48:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-08 22:48:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 185 states have internal predecessors, (197), 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-03-08 22:48:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2025-03-08 22:48:44,914 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 66 [2025-03-08 22:48:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,915 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2025-03-08 22:48:44,915 INFO L472 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-03-08 22:48:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2025-03-08 22:48:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 22:48:44,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,916 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-03-08 22:48:44,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:48:45,116 WARN L453 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-03-08 22:48:45,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -754446134, now seen corresponding path program 1 times [2025-03-08 22:48:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-03-08 22:48:45,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:45,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:48:45,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:48:45,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:45,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:48:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029340305] [2025-03-08 22:48:45,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:45,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:45,323 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-03-08 22:48:45,326 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-03-08 22:48:45,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:48:45,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:48:45,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:45,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:45,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 22:48:45,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:45,564 INFO L378 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-03-08 22:48:45,596 INFO L378 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-03-08 22:48:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 22:48:45,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:48:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309341872] [2025-03-08 22:48:45,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:48:45,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029340305] [2025-03-08 22:48:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029340305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:45,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2025-03-08 22:48:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201222913] [2025-03-08 22:48:45,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:45,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:48:45,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:45,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:48:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:45,892 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 22:48:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:46,198 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2025-03-08 22:48:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-03-08 22:48:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:46,199 INFO L225 Difference]: With dead ends: 213 [2025-03-08 22:48:46,199 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 22:48:46,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:48:46,200 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 31 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:46,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1091 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 22:48:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-08 22:48:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 189 states have internal predecessors, (201), 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-03-08 22:48:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 213 transitions. [2025-03-08 22:48:46,212 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 213 transitions. Word has length 71 [2025-03-08 22:48:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:46,212 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 213 transitions. [2025-03-08 22:48:46,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 22:48:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 213 transitions. [2025-03-08 22:48:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 22:48:46,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:46,213 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-03-08 22:48:46,222 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-03-08 22:48:46,418 WARN L453 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-03-08 22:48:46,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:48:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:46,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1486524820, now seen corresponding path program 2 times [2025-03-08 22:48:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391483995] [2025-03-08 22:48:46,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:48:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:46,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:48:46,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:48:46,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:48:46,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:48:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544765444] [2025-03-08 22:48:46,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:48:46,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:46,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:46,553 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-03-08 22:48:46,555 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-03-08 22:48:46,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 22:48:46,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:48:46,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:48:46,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:46,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:48:46,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:46,928 INFO L378 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-03-08 22:48:46,963 INFO L378 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-03-08 22:48:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 22:48:47,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 22:48:47,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391483995] [2025-03-08 22:48:47,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:48:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544765444] [2025-03-08 22:48:47,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544765444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:47,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:47,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-08 22:48:47,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968299459] [2025-03-08 22:48:47,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:47,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:48:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:47,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:48:47,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:47,418 INFO L87 Difference]: Start difference. First operand 198 states and 213 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-03-08 22:48:55,636 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 22:49:03,762 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 22:49:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:08,295 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2025-03-08 22:49:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:49:08,295 INFO L78 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-03-08 22:49:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:08,296 INFO L225 Difference]: With dead ends: 222 [2025-03-08 22:49:08,296 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:49:08,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=307, Invalid=952, Unknown=1, NotChecked=0, Total=1260 [2025-03-08 22:49:08,297 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 31 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:08,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2021 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:49:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:49:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-08 22:49:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 125 states have (on average 1.704) internal successors, (213), 198 states have internal predecessors, (213), 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-03-08 22:49:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 225 transitions. [2025-03-08 22:49:08,305 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 225 transitions. Word has length 86 [2025-03-08 22:49:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 225 transitions. [2025-03-08 22:49:08,306 INFO L472 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-03-08 22:49:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2025-03-08 22:49:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 22:49:08,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:08,309 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-03-08 22:49:08,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:49:08,509 WARN L453 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-03-08 22:49:08,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:49:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -295631596, now seen corresponding path program 3 times [2025-03-08 22:49:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502953396] [2025-03-08 22:49:08,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:49:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:08,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-03-08 22:49:08,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 22:49:08,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-08 22:49:08,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 22:49:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675668972] [2025-03-08 22:49:08,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:49:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:08,959 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-03-08 22:49:08,962 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-03-08 22:49:09,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-03-08 22:49:09,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-03-08 22:49:09,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:49:09,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:09,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:49:09,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:09,125 INFO L378 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-03-08 22:49:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-03-08 22:49:09,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:49:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502953396] [2025-03-08 22:49:09,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 22:49:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675668972] [2025-03-08 22:49:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675668972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719065363] [2025-03-08 22:49:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:09,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:49:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:09,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:49:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:49:09,139 INFO L87 Difference]: Start difference. First operand 207 states and 225 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-03-08 22:49:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:09,246 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2025-03-08 22:49:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:49:09,247 INFO L78 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-03-08 22:49:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:09,248 INFO L225 Difference]: With dead ends: 206 [2025-03-08 22:49:09,248 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 22:49:09,248 INFO L434 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-03-08 22:49:09,249 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:09,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 527 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 22:49:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-08 22:49:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 125 states have (on average 1.696) internal successors, (212), 197 states have internal predecessors, (212), 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-03-08 22:49:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2025-03-08 22:49:09,256 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 106 [2025-03-08 22:49:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:09,257 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2025-03-08 22:49:09,257 INFO L472 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-03-08 22:49:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2025-03-08 22:49:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 22:49:09,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:09,260 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:49:09,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:49:09,460 WARN L453 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-03-08 22:49:09,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:49:09,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 148375014, now seen corresponding path program 1 times [2025-03-08 22:49:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629289451] [2025-03-08 22:49:09,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:49:09,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:49:09,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:09,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 523 proven. 4 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 22:49:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629289451] [2025-03-08 22:49:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629289451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:10,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881876414] [2025-03-08 22:49:10,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:10,315 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-03-08 22:49:10,316 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-03-08 22:49:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:49:10,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:49:10,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:10,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:10,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:49:10,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:10,625 WARN L873 $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-03-08 22:49:10,665 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:49:10,665 INFO L378 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-03-08 22:49:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 33 not checked. [2025-03-08 22:49:10,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:10,876 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:49:10,876 INFO L378 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-03-08 22:49:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 34 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 22:49:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881876414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:49:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-03-08 22:49:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977308892] [2025-03-08 22:49:10,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:10,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:49:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:49:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-03-08 22:49:10,899 INFO L87 Difference]: Start difference. First operand 206 states and 224 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-03-08 22:49:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:11,460 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2025-03-08 22:49:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:49:11,460 INFO L78 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 115 [2025-03-08 22:49:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:11,461 INFO L225 Difference]: With dead ends: 204 [2025-03-08 22:49:11,462 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 22:49:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2025-03-08 22:49:11,462 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 17 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:11,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1325 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 758 Invalid, 0 Unknown, 187 Unchecked, 0.5s Time] [2025-03-08 22:49:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 22:49:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 22:49:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 125 states have (on average 1.68) internal successors, (210), 195 states have internal predecessors, (210), 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-03-08 22:49:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2025-03-08 22:49:11,467 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 115 [2025-03-08 22:49:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:11,467 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2025-03-08 22:49:11,467 INFO L472 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-03-08 22:49:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2025-03-08 22:49:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 22:49:11,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:11,468 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:49:11,477 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-03-08 22:49:11,668 WARN L453 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-03-08 22:49:11,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:49:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 148375015, now seen corresponding path program 1 times [2025-03-08 22:49:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360519077] [2025-03-08 22:49:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:49:11,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:49:11,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:11,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 70 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-03-08 22:49:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360519077] [2025-03-08 22:49:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360519077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085287944] [2025-03-08 22:49:13,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:13,483 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-03-08 22:49:13,485 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-03-08 22:49:13,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:49:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:49:14,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:14,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:14,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-08 22:49:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:14,535 INFO L378 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-03-08 22:49:16,605 WARN L873 $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-03-08 22:49:16,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:49:16,660 INFO L378 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-03-08 22:49:16,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:49:16,666 INFO L378 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-03-08 22:49:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 398 proven. 499 refuted. 0 times theorem prover too weak. 272 trivial. 79 not checked. [2025-03-08 22:49:16,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085287944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:16,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2025-03-08 22:49:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245650493] [2025-03-08 22:49:16,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:16,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 22:49:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:16,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 22:49:16,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2195, Unknown=1, NotChecked=94, Total=2450 [2025-03-08 22:49:16,884 INFO L87 Difference]: Start difference. First operand 204 states and 222 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-03-08 22:49:20,920 WARN L539 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-03-08 22:49:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:24,712 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2025-03-08 22:49:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:49:24,713 INFO L78 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 115 [2025-03-08 22:49:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:24,715 INFO L225 Difference]: With dead ends: 233 [2025-03-08 22:49:24,715 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 22:49:24,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=344, Invalid=4351, Unknown=1, NotChecked=134, Total=4830 [2025-03-08 22:49:24,717 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 30 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:24,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3319 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2479 Invalid, 1 Unknown, 206 Unchecked, 6.2s Time] [2025-03-08 22:49:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 22:49:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 202. [2025-03-08 22:49:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.664) internal successors, (208), 193 states have internal predecessors, (208), 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-03-08 22:49:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2025-03-08 22:49:24,725 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 115 [2025-03-08 22:49:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:24,725 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2025-03-08 22:49:24,725 INFO L472 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-03-08 22:49:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2025-03-08 22:49:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 22:49:24,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:24,728 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:49:24,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:49:24,928 WARN L453 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-03-08 22:49:24,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:49:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 854472547, now seen corresponding path program 1 times [2025-03-08 22:49:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532087675] [2025-03-08 22:49:24,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:24,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:49:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:49:24,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:24,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 668 proven. 126 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-08 22:49:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532087675] [2025-03-08 22:49:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532087675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902175287] [2025-03-08 22:49:25,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:25,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:25,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:25,894 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-03-08 22:49:25,896 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-03-08 22:49:26,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:49:26,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:49:26,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:26,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:26,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:49:26,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:26,293 WARN L873 $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-03-08 22:49:26,342 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:49:26,343 INFO L378 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-03-08 22:49:26,383 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:49:26,383 INFO L378 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-03-08 22:49:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 2 refuted. 0 times theorem prover too weak. 488 trivial. 120 not checked. [2025-03-08 22:49:26,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:26,739 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:49:26,740 INFO L378 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-03-08 22:49:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 122 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-08 22:49:26,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902175287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:26,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:49:26,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 23 [2025-03-08 22:49:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179940271] [2025-03-08 22:49:26,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:26,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:49:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:26,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:49:26,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-03-08 22:49:26,754 INFO L87 Difference]: Start difference. First operand 202 states and 220 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-03-08 22:49:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:27,533 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2025-03-08 22:49:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:49:27,534 INFO L78 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 117 [2025-03-08 22:49:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:27,535 INFO L225 Difference]: With dead ends: 199 [2025-03-08 22:49:27,535 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 22:49:27,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2025-03-08 22:49:27,535 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 27 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:27,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1968 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1315 Invalid, 0 Unknown, 182 Unchecked, 0.7s Time] [2025-03-08 22:49:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 22:49:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 22:49:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 125 states have (on average 1.64) internal successors, (205), 190 states have internal predecessors, (205), 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-03-08 22:49:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2025-03-08 22:49:27,539 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 117 [2025-03-08 22:49:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:27,539 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2025-03-08 22:49:27,539 INFO L472 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-03-08 22:49:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2025-03-08 22:49:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 22:49:27,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:27,540 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:49:27,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:49:27,743 WARN L453 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-03-08 22:49:27,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:49:27,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 854472548, now seen corresponding path program 1 times [2025-03-08 22:49:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:27,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-08 22:49:27,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:27,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:49:27,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:49:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:27,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 192 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-08 22:49:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637635220] [2025-03-08 22:49:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637635220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861907606] [2025-03-08 22:49:29,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:29,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:29,528 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-03-08 22:49:29,530 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-03-08 22:49:29,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:49:30,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:49:30,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:30,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:30,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 22:49:30,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:30,375 INFO L378 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-03-08 22:49:32,732 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:49:32,732 INFO L378 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-03-08 22:49:32,741 INFO L378 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-03-08 22:49:32,841 WARN L873 $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-03-08 22:49:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:49:32,884 INFO L378 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-03-08 22:49:32,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:49:32,898 INFO L378 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-03-08 22:49:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 498 proven. 404 refuted. 0 times theorem prover too weak. 257 trivial. 89 not checked. [2025-03-08 22:49:33,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861907606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:33,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:49:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 53 [2025-03-08 22:49:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817112707] [2025-03-08 22:49:33,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 22:49:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:33,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 22:49:33,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2806, Unknown=1, NotChecked=106, Total=3080 [2025-03-08 22:49:33,173 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 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-03-08 22:49:37,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:49:41,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 22:49:50,101 WARN L539 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-03-08 22:49:54,321 WARN L539 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-03-08 22:49:59,495 WARN L539 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-03-08 22:50:03,775 WARN L539 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-03-08 22:50:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:09,450 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2025-03-08 22:50:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 22:50:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 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 117 [2025-03-08 22:50:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:09,452 INFO L225 Difference]: With dead ends: 204 [2025-03-08 22:50:09,452 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 22:50:09,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=344, Invalid=4628, Unknown=2, NotChecked=138, Total=5112 [2025-03-08 22:50:09,453 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 48 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3704 SdHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:09,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3704 Invalid, 3699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3497 Invalid, 6 Unknown, 179 Unchecked, 29.8s Time] [2025-03-08 22:50:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 22:50:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2025-03-08 22:50:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 125 states have (on average 1.616) internal successors, (202), 187 states have internal predecessors, (202), 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-03-08 22:50:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 214 transitions. [2025-03-08 22:50:09,457 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 214 transitions. Word has length 117 [2025-03-08 22:50:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:09,457 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 214 transitions. [2025-03-08 22:50:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 50 states have internal predecessors, (101), 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-03-08 22:50:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 214 transitions. [2025-03-08 22:50:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 22:50:09,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:09,458 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:50:09,477 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-03-08 22:50:09,658 WARN L453 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-03-08 22:50:09,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:50:09,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:09,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1248629923, now seen corresponding path program 1 times [2025-03-08 22:50:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232169171] [2025-03-08 22:50:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:50:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:50:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:09,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 695 proven. 188 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 22:50:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232169171] [2025-03-08 22:50:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232169171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578065909] [2025-03-08 22:50:10,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:10,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:10,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:10,822 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-03-08 22:50:10,823 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-03-08 22:50:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:50:11,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:50:11,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:11,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:11,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 22:50:11,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:11,323 WARN L851 $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~ret9#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-03-08 22:50:11,326 WARN L873 $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~ret9#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-03-08 22:50:11,335 WARN L851 $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-03-08 22:50:11,337 WARN L873 $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-03-08 22:50:11,351 WARN L851 $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-03-08 22:50:11,353 WARN L873 $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-03-08 22:50:11,465 WARN L851 $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_#t~ret6#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_#t~ret6#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-03-08 22:50:11,470 WARN L873 $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_#t~ret6#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_#t~ret6#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-03-08 22:50:11,521 WARN L851 $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-03-08 22:50:11,526 WARN L873 $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-03-08 22:50:11,566 WARN L873 $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-03-08 22:50:11,602 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:11,602 INFO L378 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-03-08 22:50:11,722 WARN L851 $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-03-08 22:50:11,726 WARN L873 $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-03-08 22:50:11,848 WARN L851 $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-03-08 22:50:11,853 WARN L873 $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-03-08 22:50:12,053 WARN L851 $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-03-08 22:50:12,058 WARN L873 $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-03-08 22:50:12,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (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 ((.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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (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)) .cse4 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (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)))) .cse4))) is different from false [2025-03-08 22:50:12,282 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (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 ((.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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (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)) .cse4 .cse1 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (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)))) .cse4))) is different from true [2025-03-08 22:50:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 606 proven. 262 refuted. 0 times theorem prover too weak. 281 trivial. 99 not checked. [2025-03-08 22:50:12,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578065909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:12,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:50:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 33 [2025-03-08 22:50:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693747197] [2025-03-08 22:50:12,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:12,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:50:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:12,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:50:12,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=623, Unknown=19, NotChecked=590, Total=1332 [2025-03-08 22:50:12,514 INFO L87 Difference]: Start difference. First operand 196 states and 214 transitions. Second operand has 34 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 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-03-08 22:50:12,777 WARN L851 $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~ret9#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-03-08 22:50:12,778 WARN L873 $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~ret9#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-03-08 22:50:12,782 WARN L851 $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-03-08 22:50:12,783 WARN L873 $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-03-08 22:50:12,786 WARN L851 $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-03-08 22:50:12,787 WARN L873 $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-03-08 22:50:12,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (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_#t~ret6#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)))) .cse2 (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_#t~ret6#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))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse2 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-03-08 22:50:12,810 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (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_#t~ret6#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)))) .cse2 (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_#t~ret6#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))))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse2 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-03-08 22:50:12,830 WARN L851 $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-03-08 22:50:12,832 WARN L873 $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-03-08 22:50:12,929 WARN L851 $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-03-08 22:50:12,932 WARN L873 $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-03-08 22:50:12,961 WARN L851 $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-03-08 22:50:12,964 WARN L873 $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-03-08 22:50:13,039 WARN L851 $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-03-08 22:50:13,043 WARN L873 $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-03-08 22:50:13,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (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 ((.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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (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)) .cse4 .cse1 .cse5) (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)))) .cse4))) .cse5)) is different from false [2025-03-08 22:50:13,125 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (let ((.cse1 (exists ((v_ArrVal_3621 Int)) (= 1 (select |c_#valid| v_ArrVal_3621)))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (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 ((.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)))) .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) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_51|)) (.cse3 (@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| .cse2 (select |v_old(#valid)_AFTER_CALL_51| .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| .cse3 (select |v_old(#valid)_AFTER_CALL_52| .cse3)) |v_old(#valid)_AFTER_CALL_52|) (= (select |c_#valid| .cse2) 1) (= (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)) .cse4 .cse1 .cse5) (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)))) .cse4))) .cse5)) is different from true [2025-03-08 22:50:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:13,773 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2025-03-08 22:50:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:50:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 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 123 [2025-03-08 22:50:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:13,774 INFO L225 Difference]: With dead ends: 215 [2025-03-08 22:50:13,774 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 22:50:13,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=154, Invalid=877, Unknown=37, NotChecked=1482, Total=2550 [2025-03-08 22:50:13,775 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2497 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:13,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2112 Invalid, 3952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1429 Invalid, 0 Unknown, 2497 Unchecked, 0.8s Time] [2025-03-08 22:50:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 22:50:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-08 22:50:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 141 states have (on average 1.5673758865248226) internal successors, (221), 203 states have internal predecessors, (221), 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-03-08 22:50:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 239 transitions. [2025-03-08 22:50:13,779 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 239 transitions. Word has length 123 [2025-03-08 22:50:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:13,779 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 239 transitions. [2025-03-08 22:50:13,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 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-03-08 22:50:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 239 transitions. [2025-03-08 22:50:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 22:50:13,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:13,781 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-08 22:50:13,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:50:13,981 WARN L453 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-03-08 22:50:13,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 72 more)] === [2025-03-08 22:50:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1248629922, now seen corresponding path program 1 times [2025-03-08 22:50:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314201841] [2025-03-08 22:50:13,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:50:14,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:50:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat