./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0220.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0220.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:22:36,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:22:36,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:22:36,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:22:36,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:22:36,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:22:36,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:22:36,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:22:36,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:22:36,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:22:36,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:22:36,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:22:36,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:22:36,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:22:36,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:22:36,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:36,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:22:36,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:22:36,402 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-jdk21/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 -> 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 [2025-02-08 06:22:36,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:22:36,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:22:36,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:22:36,634 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:22:36,634 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:22:36,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0220.i [2025-02-08 06:22:37,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/127cc077d/50e86a01b66a4cefbfa1104ea26ae1af/FLAGd799418bf [2025-02-08 06:22:38,087 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:22:38,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0220.i [2025-02-08 06:22:38,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/127cc077d/50e86a01b66a4cefbfa1104ea26ae1af/FLAGd799418bf [2025-02-08 06:22:38,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/127cc077d/50e86a01b66a4cefbfa1104ea26ae1af [2025-02-08 06:22:38,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:22:38,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:22:38,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:38,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:22:38,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:22:38,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38, skipping insertion in model container [2025-02-08 06:22:38,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:22:38,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:38,598 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:22:38,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:38,652 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:22:38,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38 WrapperNode [2025-02-08 06:22:38,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:38,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:38,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:22:38,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:22:38,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,686 INFO L138 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2025-02-08 06:22:38,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:38,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:22:38,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:22:38,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:22:38,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,722 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-02-08 06:22:38,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:22:38,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:22:38,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:22:38,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:22:38,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:38,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:22:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:22:38,795 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2025-02-08 06:22:38,795 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2025-02-08 06:22:38,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:22:38,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:22:38,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:22:38,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:22:38,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:22:38,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:22:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:22:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:22:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:22:38,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:22:38,905 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:22:38,907 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:22:38,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; [2025-02-08 06:22:39,215 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-02-08 06:22:39,215 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:22:39,223 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:22:39,225 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:22:39,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:39 BoogieIcfgContainer [2025-02-08 06:22:39,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:22:39,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:22:39,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:22:39,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:22:39,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:22:38" (1/3) ... [2025-02-08 06:22:39,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56affc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:39, skipping insertion in model container [2025-02-08 06:22:39,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (2/3) ... [2025-02-08 06:22:39,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56affc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:39, skipping insertion in model container [2025-02-08 06:22:39,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:39" (3/3) ... [2025-02-08 06:22:39,235 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0220.i [2025-02-08 06:22:39,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:22:39,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0220.i that has 2 procedures, 108 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2025-02-08 06:22:39,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:22:39,281 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;@178dfbec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:22:39,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 06:22:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:22:39,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:39,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:22:39,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:39,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 140223577, now seen corresponding path program 1 times [2025-02-08 06:22:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397873882] [2025-02-08 06:22:39,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:22:39,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:22:39,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:39,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397873882] [2025-02-08 06:22:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397873882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722998602] [2025-02-08 06:22:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:39,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:39,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:39,526 INFO L87 Difference]: Start difference. First operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:22:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:39,627 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2025-02-08 06:22:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 06:22:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:39,634 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:22:39,634 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:22:39,636 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-02-08 06:22:39,639 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:39,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:22:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 06:22:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2025-02-08 06:22:39,675 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 5 [2025-02-08 06:22:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:39,676 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2025-02-08 06:22:39,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:22:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2025-02-08 06:22:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:22:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:39,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:22:39,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:22:39,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:39,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 51963564, now seen corresponding path program 1 times [2025-02-08 06:22:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926378742] [2025-02-08 06:22:39,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:39,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:22:39,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:22:39,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 06:22:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547639404] [2025-02-08 06:22:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:39,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:39,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:39,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:22:39,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:22:39,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:22:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:39,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:39,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:22:39,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:39,863 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-02-08 06:22:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:39,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:22:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926378742] [2025-02-08 06:22:39,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 06:22:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547639404] [2025-02-08 06:22:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547639404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:22:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586489748] [2025-02-08 06:22:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:39,885 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-02-08 06:22:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:39,980 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-02-08 06:22:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:39,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-02-08 06:22:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:39,981 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:22:39,982 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:22:39,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-08 06:22:39,983 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:39,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:22:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 06:22:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 100 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2025-02-08 06:22:39,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 6 [2025-02-08 06:22:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:39,989 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2025-02-08 06:22:39,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-02-08 06:22:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2025-02-08 06:22:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:22:39,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:39,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:39,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:22:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:40,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1144210886, now seen corresponding path program 1 times [2025-02-08 06:22:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214126025] [2025-02-08 06:22:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:40,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:40,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214126025] [2025-02-08 06:22:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214126025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642105787] [2025-02-08 06:22:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:22:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:22:40,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:40,492 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,680 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-02-08 06:22:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:40,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:22:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,681 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:22:40,681 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:22:40,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:40,682 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 383 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:22:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:22:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-02-08 06:22:40,691 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 23 [2025-02-08 06:22:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-02-08 06:22:40,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-02-08 06:22:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:22:40,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:22:40,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1144210885, now seen corresponding path program 1 times [2025-02-08 06:22:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502988652] [2025-02-08 06:22:40,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:40,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 06:22:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521340559] [2025-02-08 06:22:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:40,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:40,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:22:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:40,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:40,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 06:22:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:40,829 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-02-08 06:22:41,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:22:41,122 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-02-08 06:22:41,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:22:41,138 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-02-08 06:22:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:41,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:22:41,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502988652] [2025-02-08 06:22:41,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 06:22:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521340559] [2025-02-08 06:22:41,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521340559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:22:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051635748] [2025-02-08 06:22:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:22:41,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:22:41,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:41,158 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,461 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-02-08 06:22:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:22:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,462 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:22:41,462 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:22:41,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:22:41,463 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 27 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 309 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:22:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:22:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:22:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 94 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-02-08 06:22:41,474 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 23 [2025-02-08 06:22:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-02-08 06:22:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-02-08 06:22:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:22:41,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:41,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:22:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:41,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 909239027, now seen corresponding path program 1 times [2025-02-08 06:22:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926292926] [2025-02-08 06:22:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:22:41,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:22:41,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926292926] [2025-02-08 06:22:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926292926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389669973] [2025-02-08 06:22:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:41,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:41,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:41,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:22:42,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:22:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:22:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:22:42,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:42,124 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| 1))) is different from true [2025-02-08 06:22:42,157 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:22:42,157 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-02-08 06:22:42,181 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:22:42,182 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-02-08 06:22:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:22:42,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:42,390 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:22:42,390 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-02-08 06:22:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389669973] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:42,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2025-02-08 06:22:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878411950] [2025-02-08 06:22:42,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:22:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:42,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:22:42,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-02-08 06:22:42,396 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:22:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,628 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-02-08 06:22:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-02-08 06:22:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,629 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:22:42,629 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:22:42,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:22:42,629 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 427 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2025-02-08 06:22:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:22:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-08 06:22:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-02-08 06:22:42,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 27 [2025-02-08 06:22:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,636 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-02-08 06:22:42,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:22:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-02-08 06:22:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:22:42,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:22:42,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:42,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:42,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash 909239028, now seen corresponding path program 1 times [2025-02-08 06:22:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975000211] [2025-02-08 06:22:42,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:22:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:22:42,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975000211] [2025-02-08 06:22:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975000211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:22:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043957779] [2025-02-08 06:22:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:22:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:22:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:43,206 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:43,433 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2025-02-08 06:22:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-02-08 06:22:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:43,435 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:22:43,435 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:22:43,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:43,436 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:43,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:22:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:22:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 94 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:22:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-02-08 06:22:43,445 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 27 [2025-02-08 06:22:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:43,445 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-02-08 06:22:43,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:22:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-02-08 06:22:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:22:43,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:43,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:43,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:22:43,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:22:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 61802842, now seen corresponding path program 1 times [2025-02-08 06:22:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122221819] [2025-02-08 06:22:43,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:43,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:22:43,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:22:43,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:43,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122221819] [2025-02-08 06:22:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122221819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214810063] [2025-02-08 06:22:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:43,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:43,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:43,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:43,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:22:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:22:43,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:22:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:43,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:22:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:44,039 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-02-08 06:22:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:22:47,208 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-02-08 06:22:47,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:22:47,216 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-02-08 06:22:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:47,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:47,973 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:22:47,974 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 13 treesize of output 12 [2025-02-08 06:22:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214810063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:48,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-02-08 06:22:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196228026] [2025-02-08 06:22:48,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:22:48,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:22:48,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:22:48,061 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 23 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:23:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:05,389 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2025-02-08 06:23:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:23:05,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 23 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2025-02-08 06:23:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:05,391 INFO L225 Difference]: With dead ends: 113 [2025-02-08 06:23:05,391 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:23:05,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=159, Invalid=829, Unknown=4, NotChecked=0, Total=992 [2025-02-08 06:23:05,392 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 24 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:05,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 533 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:23:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:23:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-02-08 06:23:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-02-08 06:23:05,400 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 28 [2025-02-08 06:23:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-02-08 06:23:05,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 23 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:23:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-02-08 06:23:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:23:05,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:05,402 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:05,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:23:05,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 06:23:05,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:05,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1065045108, now seen corresponding path program 2 times [2025-02-08 06:23:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493706295] [2025-02-08 06:23:05,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:23:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:05,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 06:23:05,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:23:05,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:23:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 06:23:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10595898] [2025-02-08 06:23:05,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:23:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:05,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:05,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:23:05,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 06:23:05,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:23:05,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:23:05,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 06:23:05,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:05,756 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-02-08 06:23:06,084 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:23:06,084 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 17 treesize of output 21 [2025-02-08 06:23:06,092 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-02-08 06:23:06,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:06,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:23:06,174 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:23:06,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:23:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:23:06,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:23:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493706295] [2025-02-08 06:23:06,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 06:23:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10595898] [2025-02-08 06:23:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10595898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:06,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:23:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-02-08 06:23:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-02-08 06:23:06,433 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 06:23:06,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:23:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:06,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:23:06,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:23:06,434 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:07,077 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-02-08 06:23:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:23:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-02-08 06:23:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:07,078 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:23:07,078 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:23:07,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:23:07,079 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:07,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 553 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:23:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:23:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:23:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-02-08 06:23:07,083 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 31 [2025-02-08 06:23:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-02-08 06:23:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-02-08 06:23:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:23:07,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:07,084 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:07,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:23:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:07,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash -63439923, now seen corresponding path program 1 times [2025-02-08 06:23:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798530363] [2025-02-08 06:23:07,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:07,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:23:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:23:07,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:07,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:23:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798530363] [2025-02-08 06:23:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798530363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859423320] [2025-02-08 06:23:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:07,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:07,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:07,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:07,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:23:07,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:23:07,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:23:07,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:07,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:07,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:23:07,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:08,053 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| 1))) is different from true [2025-02-08 06:23:08,080 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:23:08,081 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-02-08 06:23:08,150 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:23:08,150 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-02-08 06:23:08,188 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:23:08,188 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-02-08 06:23:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 06:23:08,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:23:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859423320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:23:08,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:23:08,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2025-02-08 06:23:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727002532] [2025-02-08 06:23:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:23:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:23:08,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:23:08,233 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:08,417 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2025-02-08 06:23:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:23:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 06:23:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:08,418 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:23:08,418 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:23:08,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=360, Unknown=2, NotChecked=38, Total=462 [2025-02-08 06:23:08,419 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 59 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:08,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 216 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2025-02-08 06:23:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:23:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2025-02-08 06:23:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.626865671641791) internal successors, (109), 97 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-08 06:23:08,426 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 37 [2025-02-08 06:23:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:08,426 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-08 06:23:08,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-08 06:23:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:23:08,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:08,427 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:08,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:23:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 06:23:08,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -63439922, now seen corresponding path program 1 times [2025-02-08 06:23:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786363403] [2025-02-08 06:23:08,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:08,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:23:08,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:23:08,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:08,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:23:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786363403] [2025-02-08 06:23:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786363403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116177884] [2025-02-08 06:23:09,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:09,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:09,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:23:09,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:23:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:23:09,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:09,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:09,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:23:09,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:09,235 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|))) (= |c_#length| (store |c_old(#length)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|))))) is different from true [2025-02-08 06:23:09,274 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:23:09,274 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-02-08 06:23:09,277 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-02-08 06:23:09,303 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:23:09,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:09,340 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-02-08 06:23:09,377 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:23:09,377 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 14 treesize of output 13 [2025-02-08 06:23:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2025-02-08 06:23:09,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:23:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116177884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:09,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:23:09,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2025-02-08 06:23:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661944432] [2025-02-08 06:23:09,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:23:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:23:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:09,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:23:09,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=296, Unknown=2, NotChecked=70, Total=420 [2025-02-08 06:23:09,631 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:23:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:10,380 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-02-08 06:23:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:23:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-02-08 06:23:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:10,381 INFO L225 Difference]: With dead ends: 130 [2025-02-08 06:23:10,381 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 06:23:10,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=730, Unknown=2, NotChecked=114, Total=992 [2025-02-08 06:23:10,382 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 104 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:10,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 425 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 563 Invalid, 0 Unknown, 248 Unchecked, 0.3s Time] [2025-02-08 06:23:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 06:23:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-02-08 06:23:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-02-08 06:23:10,386 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 37 [2025-02-08 06:23:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-02-08 06:23:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:23:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-02-08 06:23:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:23:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:10,387 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:10,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:23:10,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:10,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:10,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 795584377, now seen corresponding path program 1 times [2025-02-08 06:23:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857251602] [2025-02-08 06:23:10,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:10,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:23:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:23:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:23:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857251602] [2025-02-08 06:23:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857251602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:23:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:23:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:23:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410317254] [2025-02-08 06:23:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:10,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:23:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:23:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:23:10,724 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:10,878 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2025-02-08 06:23:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:23:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-02-08 06:23:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:10,879 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:23:10,879 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:23:10,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:23:10,880 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:10,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 269 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:23:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:23:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2025-02-08 06:23:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-02-08 06:23:10,883 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 46 [2025-02-08 06:23:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:10,883 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-02-08 06:23:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-02-08 06:23:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:23:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:10,887 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:23:10,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 795584378, now seen corresponding path program 1 times [2025-02-08 06:23:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943231667] [2025-02-08 06:23:10,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:23:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:23:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943231667] [2025-02-08 06:23:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943231667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755924068] [2025-02-08 06:23:11,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:11,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:11,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:11,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:23:11,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:23:11,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:23:11,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:11,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 06:23:11,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:11,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:11,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:11,809 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:11,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-08 06:23:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:11,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:23:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:11,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:23:11,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-08 06:23:11,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2025-02-08 06:23:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:12,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:23:12,004 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 25 treesize of output 29 [2025-02-08 06:23:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755924068] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:23:12,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:23:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2025-02-08 06:23:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510205734] [2025-02-08 06:23:12,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:23:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:23:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:12,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:23:12,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:23:12,253 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 32 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 29 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:23:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:12,972 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2025-02-08 06:23:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:23:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 29 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-02-08 06:23:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:12,974 INFO L225 Difference]: With dead ends: 142 [2025-02-08 06:23:12,974 INFO L226 Difference]: Without dead ends: 142 [2025-02-08 06:23:12,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:23:12,975 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 314 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:12,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1006 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:23:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-08 06:23:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 99. [2025-02-08 06:23:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 95 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-02-08 06:23:12,978 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 46 [2025-02-08 06:23:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:12,978 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-02-08 06:23:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 29 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:23:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-02-08 06:23:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:23:12,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:12,979 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:12,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:23:13,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:13,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:13,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1624665570, now seen corresponding path program 1 times [2025-02-08 06:23:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540039324] [2025-02-08 06:23:13,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:13,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:23:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:23:13,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:13,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:23:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540039324] [2025-02-08 06:23:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540039324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:23:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:23:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:23:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912249428] [2025-02-08 06:23:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:23:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:13,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:23:13,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:23:13,260 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:13,340 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-02-08 06:23:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:23:13,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-02-08 06:23:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:13,342 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:23:13,342 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:23:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:23:13,343 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:13,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 234 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:23:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:23:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:23:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.507462686567164) internal successors, (101), 94 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-02-08 06:23:13,347 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 49 [2025-02-08 06:23:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:13,348 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-02-08 06:23:13,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:23:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-02-08 06:23:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:23:13,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:13,349 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:23:13,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:13,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1624665571, now seen corresponding path program 1 times [2025-02-08 06:23:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788150131] [2025-02-08 06:23:13,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:13,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:23:13,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:23:13,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788150131] [2025-02-08 06:23:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788150131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166545355] [2025-02-08 06:23:13,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:13,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:13,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:23:13,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:23:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:23:13,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:13,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:13,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:23:13,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:14,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:14,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:14,509 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:14,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-08 06:23:14,512 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:14,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:23:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:23:14,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:23:14,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166545355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:23:14,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:23:14,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2025-02-08 06:23:14,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151591955] [2025-02-08 06:23:14,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:14,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:23:14,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:14,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:23:14,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:23:14,517 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:14,833 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2025-02-08 06:23:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:23:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2025-02-08 06:23:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:14,834 INFO L225 Difference]: With dead ends: 139 [2025-02-08 06:23:14,834 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 06:23:14,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:23:14,835 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:14,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 327 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:23:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 06:23:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2025-02-08 06:23:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5) internal successors, (102), 95 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-02-08 06:23:14,837 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 49 [2025-02-08 06:23:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:14,837 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-02-08 06:23:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-02-08 06:23:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:23:14,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:14,838 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:14,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:23:15,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:15,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2064482241, now seen corresponding path program 1 times [2025-02-08 06:23:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650570436] [2025-02-08 06:23:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:15,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:23:15,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:23:15,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:15,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:23:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650570436] [2025-02-08 06:23:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650570436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552342901] [2025-02-08 06:23:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:15,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:15,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:23:15,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:23:15,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:23:15,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:15,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:15,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 06:23:15,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:15,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:23:16,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:23:16,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:16,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:16,173 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:16,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-08 06:23:16,176 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:16,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-08 06:23:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-08 06:23:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:23:16,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:23:16,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552342901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:23:16,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:23:16,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 23 [2025-02-08 06:23:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001598825] [2025-02-08 06:23:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:16,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:23:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:16,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:23:16,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:23:16,233 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:23:16,581 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2025-02-08 06:23:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:23:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-02-08 06:23:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:23:16,582 INFO L225 Difference]: With dead ends: 115 [2025-02-08 06:23:16,582 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 06:23:16,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:23:16,583 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:23:16,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 303 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:23:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 06:23:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2025-02-08 06:23:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 96 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:23:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-02-08 06:23:16,589 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 51 [2025-02-08 06:23:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:23:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-02-08 06:23:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-02-08 06:23:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:23:16,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:23:16,589 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:23:16,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:23:16,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:23:16,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 43 more)] === [2025-02-08 06:23:16,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:23:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2064482240, now seen corresponding path program 1 times [2025-02-08 06:23:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:23:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736099063] [2025-02-08 06:23:16,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:23:16,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:23:16,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:23:16,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:16,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:23:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:23:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736099063] [2025-02-08 06:23:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736099063] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132943245] [2025-02-08 06:23:17,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:23:17,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:23:17,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:23:17,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:23:17,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:23:17,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:23:17,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:23:17,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:23:17,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:23:17,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 06:23:17,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:23:18,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:23:18,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:23:18,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-02-08 06:23:18,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 06:23:18,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:18,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:23:18,488 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:18,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2025-02-08 06:23:18,492 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:23:18,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2025-02-08 06:23:18,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-08 06:23:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:23:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:18,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:23:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 165 [2025-02-08 06:23:18,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 245 [2025-02-08 06:23:45,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2025-02-08 06:23:45,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:23:45,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 125 [2025-02-08 06:23:45,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2025-02-08 06:23:45,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2025-02-08 06:23:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:23:46,022 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 7 treesize of output 5 [2025-02-08 06:23:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:23:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132943245] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 06:23:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:23:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [14, 20] total 51 [2025-02-08 06:23:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882894174] [2025-02-08 06:23:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:23:54,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:23:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:23:54,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:23:54,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2323, Unknown=7, NotChecked=0, Total=2550 [2025-02-08 06:23:54,722 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:23:59,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse4 (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4)) (.cse1 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (.cse3 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|))) (let ((.cse11 (and .cse1 (<= (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 1) 0) .cse3)) (.cse6 (or (not .cse3) (let ((.cse19 (select .cse5 .cse4))) (and (<= 0 .cse19) (<= (+ .cse19 4) (select |c_#length| (select .cse9 .cse4))))) (not .cse1))) (.cse0 (and .cse1 .cse3))) (and (or .cse0 (< |c_ULTIMATE.start_l1_insert_~list#1.offset| 0)) (or (and (or (let ((.cse2 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (< v_arrayElimCell_47 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_47)) 1)))))) (and (or .cse1 .cse2) (or .cse3 .cse2) (forall ((v_arrayElimCell_47 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (< v_arrayElimCell_47 0) (forall ((v_arrayElimCell_46 Int)) (or (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46) .cse4) 1)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_47)) 1)))))))) .cse0) .cse6 (or .cse0 (let ((.cse7 (forall ((v_ArrVal_1063 Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (let ((.cse10 (+ 4 v_arrayElimCell_47))) (< (+ 3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_46) .cse10)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse9 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1063)) v_arrayElimCell_46) .cse10)))) (< v_arrayElimCell_47 0))))) (and (or .cse1 .cse7) (forall ((v_ArrVal_1063 Int) (v_arrayElimCell_47 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_46 Int)) (or (let ((.cse8 (+ 4 v_arrayElimCell_47))) (< (+ 3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_46) .cse8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse9 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1063)) v_arrayElimCell_46) .cse8)))) (< (+ 3 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46) .cse4)) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_46) .cse4))))) (< v_arrayElimCell_47 0))) (or .cse3 .cse7))))) .cse11) (< |c_~#list~0.offset| 1) (or .cse11 (and (or (let ((.cse13 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (or (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46) (+ 4 v_arrayElimCell_47)) 1)) (< v_arrayElimCell_47 0))))) (and (forall ((v_arrayElimCell_47 Int)) (or (< v_arrayElimCell_47 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46))) (or (< 0 (+ (select .cse12 .cse4) 1)) (< 0 (+ (select .cse12 (+ 4 v_arrayElimCell_47)) 1))))))) (or .cse1 .cse13) (or .cse13 .cse3))) .cse0) .cse6 (or .cse0 (let ((.cse14 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (or (< v_arrayElimCell_47 0) (let ((.cse18 (+ 4 v_arrayElimCell_47))) (< (+ 3 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46) .cse18)) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_46) .cse18)))))))) (and (or .cse3 .cse14) (forall ((v_arrayElimCell_47 Int)) (or (< v_arrayElimCell_47 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_46)) (.cse17 (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_46))) (or (let ((.cse16 (+ 4 v_arrayElimCell_47))) (< (+ 3 (select .cse15 .cse16)) (select |c_#length| (select .cse17 .cse16)))) (< (+ 3 (select .cse15 .cse4)) (select |c_#length| (select .cse17 .cse4)))))))) (or .cse1 .cse14))))))))) is different from false [2025-02-08 06:24:03,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 06:24:07,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 06:24:11,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]