./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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-broom/sll-nested-sll-twice.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:32:51,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:32:51,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:32:51,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:32:51,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:32:51,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:32:51,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:32:51,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:32:51,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:32:51,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:32:51,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:32:51,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:32:51,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:32:51,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:32:51,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:51,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:51,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:51,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:32:51,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:32:51,902 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2025-01-09 22:32:52,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:32:52,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:32:52,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:32:52,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:32:52,127 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:32:52,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2025-01-09 22:32:53,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9408560/f19b7098bb9b46ae9871cc94999bb985/FLAG163eaa135 [2025-01-09 22:32:53,599 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:32:53,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2025-01-09 22:32:53,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9408560/f19b7098bb9b46ae9871cc94999bb985/FLAG163eaa135 [2025-01-09 22:32:53,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9408560/f19b7098bb9b46ae9871cc94999bb985 [2025-01-09 22:32:53,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:32:53,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:32:53,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:53,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:32:53,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:32:53,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:53" (1/1) ... [2025-01-09 22:32:53,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a06d7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:53, skipping insertion in model container [2025-01-09 22:32:53,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:53" (1/1) ... [2025-01-09 22:32:53,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:32:54,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:54,138 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:32:54,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:54,197 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:32:54,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54 WrapperNode [2025-01-09 22:32:54,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:54,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:54,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:32:54,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:32:54,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,233 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-01-09 22:32:54,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:54,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:32:54,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:32:54,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:32:54,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,265 INFO L175 MemorySlicer]: Split 22 memory accesses to 1 slices as follows [22]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2025-01-09 22:32:54,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:32:54,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:32:54,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:32:54,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:32:54,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (1/1) ... [2025-01-09 22:32:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:54,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:54,315 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-01-09 22:32:54,317 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-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2025-01-09 22:32:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-01-09 22:32:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-01-09 22:32:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:32:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:32:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2025-01-09 22:32:54,333 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2025-01-09 22:32:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:32:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:32:54,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:32:54,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:32:54,410 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:32:54,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:32:54,733 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 22:32:54,733 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:32:54,746 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:32:54,746 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:32:54,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:54 BoogieIcfgContainer [2025-01-09 22:32:54,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:32:54,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:32:54,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:32:54,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:32:54,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:53" (1/3) ... [2025-01-09 22:32:54,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83abaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:54, skipping insertion in model container [2025-01-09 22:32:54,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:54" (2/3) ... [2025-01-09 22:32:54,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83abaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:54, skipping insertion in model container [2025-01-09 22:32:54,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:54" (3/3) ... [2025-01-09 22:32:54,756 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2025-01-09 22:32:54,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:32:54,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-twice.i that has 6 procedures, 143 locations, 1 initial locations, 6 loop locations, and 51 error locations. [2025-01-09 22:32:54,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:32:54,809 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;@777ed450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:32:54,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 22:32:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 125 states have internal predecessors, (133), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:32:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:54,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:54,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:54,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 51745431, now seen corresponding path program 1 times [2025-01-09 22:32:54,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593374558] [2025-01-09 22:32:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:54,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:54,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:54,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:54,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:54,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593374558] [2025-01-09 22:32:54,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593374558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:54,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:54,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63937250] [2025-01-09 22:32:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:54,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:54,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:54,992 INFO L87 Difference]: Start difference. First operand has 143 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 125 states have internal predecessors, (133), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-01-09 22:32:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,115 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2025-01-09 22:32:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:55,116 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-01-09 22:32:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,122 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:32:55,122 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:32:55,125 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-01-09 22:32:55,127 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:32:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-09 22:32:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.726027397260274) internal successors, (126), 120 states have internal predecessors, (126), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:32:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-01-09 22:32:55,166 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 5 [2025-01-09 22:32:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,166 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-01-09 22:32:55,166 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-01-09 22:32:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-01-09 22:32:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:55,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:32:55,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:55,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 51745432, now seen corresponding path program 1 times [2025-01-09 22:32:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371660647] [2025-01-09 22:32:55,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:55,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371660647] [2025-01-09 22:32:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371660647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016371340] [2025-01-09 22:32:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:55,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:55,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:55,258 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. 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-01-09 22:32:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,340 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-01-09 22:32:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:55,341 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-01-09 22:32:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,341 INFO L225 Difference]: With dead ends: 135 [2025-01-09 22:32:55,342 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 22:32:55,342 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-01-09 22:32:55,342 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 22:32:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-09 22:32:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 117 states have internal predecessors, (123), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:32:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-01-09 22:32:55,355 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 5 [2025-01-09 22:32:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,355 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-01-09 22:32:55,355 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-01-09 22:32:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-01-09 22:32:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:32:55,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:32:55,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash -904985423, now seen corresponding path program 1 times [2025-01-09 22:32:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437327838] [2025-01-09 22:32:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:32:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:32:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437327838] [2025-01-09 22:32:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437327838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135938086] [2025-01-09 22:32:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:55,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:55,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:55,453 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,513 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-01-09 22:32:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:32:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,515 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:32:55,515 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:32:55,515 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-01-09 22:32:55,515 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 238 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:32:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-09 22:32:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 116 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:32:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-01-09 22:32:55,526 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2025-01-09 22:32:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-01-09 22:32:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-01-09 22:32:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:32:55,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:55,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:32:55,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:55,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -904985422, now seen corresponding path program 1 times [2025-01-09 22:32:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518893189] [2025-01-09 22:32:55,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:32:55,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:32:55,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518893189] [2025-01-09 22:32:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518893189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184758543] [2025-01-09 22:32:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:55,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:55,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:55,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:55,646 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,701 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-01-09 22:32:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:32:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,702 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:32:55,702 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:32:55,702 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-01-09 22:32:55,703 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:32:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 22:32:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:32:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-01-09 22:32:55,714 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2025-01-09 22:32:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,715 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-01-09 22:32:55,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:32:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-01-09 22:32:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:32:55,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,715 INFO L218 NwaCegarLoop]: trace histogram [1, 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-01-09 22:32:55,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:32:55,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:55,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash 909197564, now seen corresponding path program 1 times [2025-01-09 22:32:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-01-09 22:32:55,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:32:55,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:32:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-01-09 22:32:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744209780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:32:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318452047] [2025-01-09 22:32:56,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:56,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:32:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:56,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:32:56,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:32:56,145 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:56,756 INFO L93 Difference]: Finished difference Result 177 states and 210 transitions. [2025-01-09 22:32:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:32:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-01-09 22:32:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:56,759 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:32:56,759 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 22:32:56,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:56,760 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 69 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:56,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 526 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:32:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 22:32:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2025-01-09 22:32:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 92 states have (on average 1.6521739130434783) internal successors, (152), 134 states have internal predecessors, (152), 16 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2025-01-09 22:32:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2025-01-09 22:32:56,776 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 25 [2025-01-09 22:32:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2025-01-09 22:32:56,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2025-01-09 22:32:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:32:56,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:56,777 INFO L218 NwaCegarLoop]: trace histogram [1, 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-01-09 22:32:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:32:56,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:56,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 909197563, now seen corresponding path program 1 times [2025-01-09 22:32:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:56,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226332117] [2025-01-09 22:32:56,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:56,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:56,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:32:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:32:56,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226332117] [2025-01-09 22:32:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226332117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:56,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:56,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:32:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367454819] [2025-01-09 22:32:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:32:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:56,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:32:56,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:32:56,925 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:57,241 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2025-01-09 22:32:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-01-09 22:32:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:57,243 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:32:57,243 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 22:32:57,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:57,244 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 67 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:57,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 479 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:32:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 22:32:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-01-09 22:32:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.607843137254902) internal successors, (164), 140 states have internal predecessors, (164), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2025-01-09 22:32:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2025-01-09 22:32:57,256 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 25 [2025-01-09 22:32:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:57,256 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2025-01-09 22:32:57,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:32:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2025-01-09 22:32:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:32:57,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:57,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:57,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:32:57,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 338427335, now seen corresponding path program 1 times [2025-01-09 22:32:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:57,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497677144] [2025-01-09 22:32:57,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:57,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:57,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:57,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497677144] [2025-01-09 22:32:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497677144] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986223479] [2025-01-09 22:32:57,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:57,427 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-01-09 22:32:57,428 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-01-09 22:32:57,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:57,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:32:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:57,530 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-01-09 22:32:57,581 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:32:57,608 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:32:57,608 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-01-09 22:32:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:57,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986223479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:57,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-01-09 22:32:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753617210] [2025-01-09 22:32:57,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:32:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:57,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:32:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:32:57,753 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:32:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:58,107 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2025-01-09 22:32:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:32:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2025-01-09 22:32:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:58,109 INFO L225 Difference]: With dead ends: 181 [2025-01-09 22:32:58,109 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 22:32:58,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:32:58,109 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 104 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:58,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 529 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 432 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2025-01-09 22:32:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 22:32:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2025-01-09 22:32:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 140 states have internal predecessors, (165), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2025-01-09 22:32:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2025-01-09 22:32:58,119 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 28 [2025-01-09 22:32:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:58,119 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2025-01-09 22:32:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:32:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2025-01-09 22:32:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:32:58,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:58,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:58,127 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-01-09 22:32:58,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:58,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:58,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 338427336, now seen corresponding path program 1 times [2025-01-09 22:32:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608547001] [2025-01-09 22:32:58,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:58,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:58,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:58,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608547001] [2025-01-09 22:32:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608547001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021584233] [2025-01-09 22:32:58,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:58,547 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-01-09 22:32:58,553 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-01-09 22:32:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:58,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:58,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:32:58,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:58,634 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-01-09 22:32:58,685 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-01-09 22:32:58,710 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:32:58,710 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-01-09 22:32:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:58,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021584233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:58,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-01-09 22:32:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578723469] [2025-01-09 22:32:58,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:32:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:32:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:32:58,783 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:32:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,115 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2025-01-09 22:32:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-01-09 22:32:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,116 INFO L225 Difference]: With dead ends: 170 [2025-01-09 22:32:59,116 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 22:32:59,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:32:59,117 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 33 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 515 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 456 Invalid, 0 Unknown, 153 Unchecked, 0.3s Time] [2025-01-09 22:32:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 22:32:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 22:32:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 142 states have internal predecessors, (166), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2025-01-09 22:32:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2025-01-09 22:32:59,129 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 28 [2025-01-09 22:32:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,129 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2025-01-09 22:32:59,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:32:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2025-01-09 22:32:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:32:59,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:59,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:32:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:59,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:32:59,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash 276617636, now seen corresponding path program 1 times [2025-01-09 22:32:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293418688] [2025-01-09 22:32:59,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:32:59,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:32:59,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293418688] [2025-01-09 22:32:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293418688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183904866] [2025-01-09 22:32:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:59,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:59,803 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-01-09 22:32:59,803 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-01-09 22:32:59,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:32:59,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:32:59,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:32:59,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:59,892 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-01-09 22:32:59,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:33:00,126 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:00,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:00,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-01-09 22:33:00,298 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:33:00,298 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-01-09 22:33:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:00,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183904866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:00,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:00,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2025-01-09 22:33:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858797571] [2025-01-09 22:33:00,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:00,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:33:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:00,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:33:00,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=510, Unknown=1, NotChecked=46, Total=650 [2025-01-09 22:33:00,501 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 22:33:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:01,258 INFO L93 Difference]: Finished difference Result 226 states and 290 transitions. [2025-01-09 22:33:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:33:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2025-01-09 22:33:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:01,260 INFO L225 Difference]: With dead ends: 226 [2025-01-09 22:33:01,260 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 22:33:01,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:33:01,261 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 182 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:01,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 595 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1216 Invalid, 0 Unknown, 232 Unchecked, 0.7s Time] [2025-01-09 22:33:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 22:33:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 184. [2025-01-09 22:33:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.5932203389830508) internal successors, (188), 152 states have internal predecessors, (188), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 26 states have call predecessors, (32), 18 states have call successors, (32) [2025-01-09 22:33:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 238 transitions. [2025-01-09 22:33:01,269 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 238 transitions. Word has length 37 [2025-01-09 22:33:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:01,269 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 238 transitions. [2025-01-09 22:33:01,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 22:33:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2025-01-09 22:33:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:33:01,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:01,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:01,276 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-01-09 22:33:01,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:01,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:01,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 276617635, now seen corresponding path program 1 times [2025-01-09 22:33:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:01,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20267111] [2025-01-09 22:33:01,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:01,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:33:01,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:33:01,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20267111] [2025-01-09 22:33:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20267111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782654261] [2025-01-09 22:33:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:01,828 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-01-09 22:33:01,830 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-01-09 22:33:01,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:33:01,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:33:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:33:01,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:01,898 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-01-09 22:33:01,950 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:01,967 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2025-01-09 22:33:01,968 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2025-01-09 22:33:01,981 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2025-01-09 22:33:01,983 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2025-01-09 22:33:02,122 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:02,123 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-01-09 22:33:02,127 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_14| (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))))))))) is different from false [2025-01-09 22:33:02,129 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_14| (store |v_#valid_BEFORE_CALL_15| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))))))))) is different from true [2025-01-09 22:33:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:33:02,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782654261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:02,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-01-09 22:33:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550694950] [2025-01-09 22:33:02,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:33:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:02,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:33:02,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2025-01-09 22:33:02,307 INFO L87 Difference]: Start difference. First operand 184 states and 238 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:02,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-01-09 22:33:02,497 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= .cse0 c_create_internal_~now~0.base) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_14| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-01-09 22:33:02,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_14| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-01-09 22:33:02,507 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_14| (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_14| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-01-09 22:33:02,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_14| (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_old(#valid)_AFTER_CALL_14| .cse1))))))))) .cse0)) is different from false [2025-01-09 22:33:02,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_14|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_14| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_14| (store |v_#valid_BEFORE_CALL_15| .cse1 (select |v_old(#valid)_AFTER_CALL_14| .cse1))))))))) .cse0)) is different from true [2025-01-09 22:33:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:02,892 INFO L93 Difference]: Finished difference Result 206 states and 260 transitions. [2025-01-09 22:33:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:33:02,892 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2025-01-09 22:33:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:02,893 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:33:02,893 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:33:02,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2025-01-09 22:33:02,894 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 138 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1035 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:02,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 634 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 712 Invalid, 0 Unknown, 1035 Unchecked, 0.5s Time] [2025-01-09 22:33:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:33:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 183. [2025-01-09 22:33:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.5897435897435896) internal successors, (186), 152 states have internal predecessors, (186), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-01-09 22:33:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2025-01-09 22:33:02,899 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 37 [2025-01-09 22:33:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2025-01-09 22:33:02,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:33:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2025-01-09 22:33:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:33:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:02,901 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:02,907 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-01-09 22:33:03,105 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,SelfDestructingSolverStorable9 [2025-01-09 22:33:03,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:03,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1466287135, now seen corresponding path program 1 times [2025-01-09 22:33:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602436734] [2025-01-09 22:33:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:03,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:33:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:33:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:03,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:03,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602436734] [2025-01-09 22:33:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602436734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791759784] [2025-01-09 22:33:03,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:03,289 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-01-09 22:33:03,293 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-01-09 22:33:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:33:03,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:33:03,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:03,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:03,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:33:03,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:03,373 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-01-09 22:33:03,381 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-01-09 22:33:03,389 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 17 treesize of output 9 [2025-01-09 22:33:03,398 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:03,410 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:03,411 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-01-09 22:33:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:03,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791759784] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:03,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-01-09 22:33:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220794732] [2025-01-09 22:33:03,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:33:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:03,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:33:03,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-01-09 22:33:03,516 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:33:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:04,018 INFO L93 Difference]: Finished difference Result 195 states and 250 transitions. [2025-01-09 22:33:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:33:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-01-09 22:33:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:04,019 INFO L225 Difference]: With dead ends: 195 [2025-01-09 22:33:04,019 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 22:33:04,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:33:04,019 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 90 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:04,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 818 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 739 Invalid, 0 Unknown, 165 Unchecked, 0.4s Time] [2025-01-09 22:33:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 22:33:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2025-01-09 22:33:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 151 states have internal predecessors, (185), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-01-09 22:33:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2025-01-09 22:33:04,027 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 40 [2025-01-09 22:33:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2025-01-09 22:33:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:33:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2025-01-09 22:33:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:33:04,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:04,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:04,034 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-01-09 22:33:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:33:04,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1466287136, now seen corresponding path program 1 times [2025-01-09 22:33:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232159551] [2025-01-09 22:33:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:04,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:33:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:33:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232159551] [2025-01-09 22:33:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232159551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868836829] [2025-01-09 22:33:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:04,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:04,517 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-01-09 22:33:04,518 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-01-09 22:33:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:33:04,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:33:04,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:04,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:33:04,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:04,600 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-01-09 22:33:04,636 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-01-09 22:33:04,638 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 11 treesize of output 7 [2025-01-09 22:33:04,658 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 17 treesize of output 9 [2025-01-09 22:33:04,694 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-01-09 22:33:04,707 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:04,707 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-01-09 22:33:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:33:04,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868836829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:04,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-01-09 22:33:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422079032] [2025-01-09 22:33:04,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 22:33:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:04,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 22:33:04,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:33:04,780 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:05,393 INFO L93 Difference]: Finished difference Result 193 states and 248 transitions. [2025-01-09 22:33:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:33:05,394 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2025-01-09 22:33:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:05,395 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:33:05,395 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:33:05,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2025-01-09 22:33:05,395 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:05,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 963 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1201 Invalid, 0 Unknown, 165 Unchecked, 0.5s Time] [2025-01-09 22:33:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:33:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2025-01-09 22:33:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 117 states have (on average 1.564102564102564) internal successors, (183), 149 states have internal predecessors, (183), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 25 states have call predecessors, (32), 18 states have call successors, (32) [2025-01-09 22:33:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2025-01-09 22:33:05,400 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 40 [2025-01-09 22:33:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:05,401 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2025-01-09 22:33:05,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2025-01-09 22:33:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:33:05,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:05,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:05,411 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-01-09 22:33:05,603 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,SelfDestructingSolverStorable11 [2025-01-09 22:33:05,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 47814254, now seen corresponding path program 1 times [2025-01-09 22:33:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-01-09 22:33:05,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:05,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:05,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:33:05,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:33:05,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-01-09 22:33:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457935807] [2025-01-09 22:33:05,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:05,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:05,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:05,879 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-01-09 22:33:05,880 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-01-09 22:33:05,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:33:05,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:33:05,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:05,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:05,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:33:05,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:06,014 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:06,029 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2025-01-09 22:33:06,031 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2025-01-09 22:33:06,047 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2025-01-09 22:33:06,049 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2025-01-09 22:33:06,143 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:06,143 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-01-09 22:33:06,155 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2025-01-09 22:33:06,158 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse0 (select |v_old(#valid)_AFTER_CALL_29| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2025-01-09 22:33:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:33:06,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457935807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:06,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2025-01-09 22:33:06,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125598353] [2025-01-09 22:33:06,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:06,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:33:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:06,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:33:06,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=150, Unknown=7, NotChecked=116, Total=342 [2025-01-09 22:33:06,316 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 22:33:06,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-01-09 22:33:06,436 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-01-09 22:33:06,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse4) 1) (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from false [2025-01-09 22:33:06,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse4) 1) (= (store |c_old(#valid)| .cse4 (select |v_old(#valid)_AFTER_CALL_29| .cse4)) |v_old(#valid)_AFTER_CALL_29|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from true [2025-01-09 22:33:06,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2025-01-09 22:33:06,449 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_old(#valid)_AFTER_CALL_29|))) (and (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_29| (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_old(#valid)_AFTER_CALL_29| .cse1))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_29| alloc_and_zero_internal_~pi~1.base 1))))) (= (select |v_old(#valid)_AFTER_CALL_30| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2025-01-09 22:33:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:06,687 INFO L93 Difference]: Finished difference Result 210 states and 266 transitions. [2025-01-09 22:33:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:33:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2025-01-09 22:33:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:06,688 INFO L225 Difference]: With dead ends: 210 [2025-01-09 22:33:06,688 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 22:33:06,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=217, Unknown=13, NotChecked=266, Total=600 [2025-01-09 22:33:06,689 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 64 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:06,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 491 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 465 Invalid, 0 Unknown, 962 Unchecked, 0.3s Time] [2025-01-09 22:33:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 22:33:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 179. [2025-01-09 22:33:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 116 states have (on average 1.5603448275862069) internal successors, (181), 149 states have internal predecessors, (181), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2025-01-09 22:33:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-01-09 22:33:06,698 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 52 [2025-01-09 22:33:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:06,698 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-01-09 22:33:06,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 22:33:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-01-09 22:33:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:33:06,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:06,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:06,707 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-01-09 22:33:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:06,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -209733494, now seen corresponding path program 1 times [2025-01-09 22:33:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192940067] [2025-01-09 22:33:06,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:33:06,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:33:06,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:06,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:33:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192940067] [2025-01-09 22:33:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192940067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:33:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866077112] [2025-01-09 22:33:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:06,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:33:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:06,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:33:06,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:33:06,970 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:07,111 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2025-01-09 22:33:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:33:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-01-09 22:33:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:07,113 INFO L225 Difference]: With dead ends: 207 [2025-01-09 22:33:07,113 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 22:33:07,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:33:07,113 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 28 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:07,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 22:33:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2025-01-09 22:33:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 137 states have (on average 1.5912408759124088) internal successors, (218), 166 states have internal predecessors, (218), 20 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (38), 28 states have call predecessors, (38), 20 states have call successors, (38) [2025-01-09 22:33:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 276 transitions. [2025-01-09 22:33:07,129 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 276 transitions. Word has length 47 [2025-01-09 22:33:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:07,129 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 276 transitions. [2025-01-09 22:33:07,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 276 transitions. [2025-01-09 22:33:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:33:07,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:07,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:33:07,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -209733493, now seen corresponding path program 1 times [2025-01-09 22:33:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289074130] [2025-01-09 22:33:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:33:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:33:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:33:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289074130] [2025-01-09 22:33:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289074130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:07,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:33:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697934430] [2025-01-09 22:33:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:07,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:33:07,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:07,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:33:07,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:33:07,293 INFO L87 Difference]: Start difference. First operand 200 states and 276 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:07,448 INFO L93 Difference]: Finished difference Result 214 states and 289 transitions. [2025-01-09 22:33:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-01-09 22:33:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:07,449 INFO L225 Difference]: With dead ends: 214 [2025-01-09 22:33:07,449 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 22:33:07,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:33:07,450 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 22 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:07,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 779 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 22:33:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2025-01-09 22:33:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.5655172413793104) internal successors, (227), 174 states have internal predecessors, (227), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2025-01-09 22:33:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 289 transitions. [2025-01-09 22:33:07,456 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 289 transitions. Word has length 47 [2025-01-09 22:33:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 289 transitions. [2025-01-09 22:33:07,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 289 transitions. [2025-01-09 22:33:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:33:07,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:07,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:33:07,458 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 310070572, now seen corresponding path program 1 times [2025-01-09 22:33:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294895903] [2025-01-09 22:33:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:07,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:33:07,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:33:07,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:07,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:33:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294895903] [2025-01-09 22:33:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294895903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:33:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586739724] [2025-01-09 22:33:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:33:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:07,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:33:07,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:33:07,544 INFO L87 Difference]: Start difference. First operand 210 states and 289 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:07,593 INFO L93 Difference]: Finished difference Result 218 states and 301 transitions. [2025-01-09 22:33:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:33:07,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-01-09 22:33:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:07,594 INFO L225 Difference]: With dead ends: 218 [2025-01-09 22:33:07,594 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 22:33:07,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:33:07,596 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 31 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:07,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 839 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:33:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 22:33:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2025-01-09 22:33:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 146 states have (on average 1.547945205479452) internal successors, (226), 175 states have internal predecessors, (226), 22 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (40), 30 states have call predecessors, (40), 22 states have call successors, (40) [2025-01-09 22:33:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2025-01-09 22:33:07,605 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 49 [2025-01-09 22:33:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:07,605 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2025-01-09 22:33:07,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:33:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2025-01-09 22:33:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:33:07,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:07,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:33:07,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1153918279, now seen corresponding path program 1 times [2025-01-09 22:33:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741214986] [2025-01-09 22:33:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:07,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:07,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741214986] [2025-01-09 22:33:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741214986] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003988348] [2025-01-09 22:33:08,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:08,184 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-01-09 22:33:08,185 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-01-09 22:33:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:08,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:08,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:08,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 22:33:08,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:08,299 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-01-09 22:33:08,338 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-01-09 22:33:08,385 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2025-01-09 22:33:08,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:08,433 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 20 treesize of output 15 [2025-01-09 22:33:08,453 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-01-09 22:33:08,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2025-01-09 22:33:08,463 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 31 treesize of output 15 [2025-01-09 22:33:08,543 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-01-09 22:33:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-01-09 22:33:08,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003988348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:16,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 30 [2025-01-09 22:33:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402523736] [2025-01-09 22:33:16,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:16,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 22:33:16,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:16,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 22:33:16,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1089, Unknown=2, NotChecked=66, Total=1260 [2025-01-09 22:33:16,792 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:33:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:18,163 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2025-01-09 22:33:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:33:18,163 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2025-01-09 22:33:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:18,164 INFO L225 Difference]: With dead ends: 259 [2025-01-09 22:33:18,165 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 22:33:18,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=169, Invalid=2089, Unknown=2, NotChecked=92, Total=2352 [2025-01-09 22:33:18,165 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:18,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1358 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2099 Invalid, 0 Unknown, 218 Unchecked, 1.0s Time] [2025-01-09 22:33:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 22:33:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2025-01-09 22:33:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 193 states have internal predecessors, (253), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 32 states have call predecessors, (41), 23 states have call successors, (41) [2025-01-09 22:33:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2025-01-09 22:33:18,172 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 51 [2025-01-09 22:33:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:18,172 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2025-01-09 22:33:18,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:33:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2025-01-09 22:33:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:33:18,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:18,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:18,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:18,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:33:18,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:18,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1153918280, now seen corresponding path program 1 times [2025-01-09 22:33:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-01-09 22:33:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:18,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:18,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:18,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:18,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-01-09 22:33:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218381593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459571924] [2025-01-09 22:33:19,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:19,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:19,279 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-01-09 22:33:19,281 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-01-09 22:33:19,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:33:19,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:33:19,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:19,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-09 22:33:19,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:19,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:33:19,425 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-01-09 22:33:19,655 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 13 treesize of output 9 [2025-01-09 22:33:19,660 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-01-09 22:33:19,792 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-01-09 22:33:19,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:19,861 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 31 treesize of output 24 [2025-01-09 22:33:19,879 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-01-09 22:33:19,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-01-09 22:33:19,885 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 20 treesize of output 15 [2025-01-09 22:33:19,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:33:19,985 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 31 treesize of output 15 [2025-01-09 22:33:19,989 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 29 treesize of output 13 [2025-01-09 22:33:20,101 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-01-09 22:33:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-01-09 22:33:20,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459571924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:20,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 38 [2025-01-09 22:33:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974212511] [2025-01-09 22:33:20,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 22:33:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:20,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 22:33:20,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1936, Unknown=1, NotChecked=88, Total=2162 [2025-01-09 22:33:20,722 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 39 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:33:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:22,902 INFO L93 Difference]: Finished difference Result 262 states and 348 transitions. [2025-01-09 22:33:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 22:33:22,905 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 51 [2025-01-09 22:33:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:22,906 INFO L225 Difference]: With dead ends: 262 [2025-01-09 22:33:22,906 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 22:33:22,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=3197, Unknown=1, NotChecked=114, Total=3540 [2025-01-09 22:33:22,907 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:22,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2008 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3174 Invalid, 0 Unknown, 223 Unchecked, 1.5s Time] [2025-01-09 22:33:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 22:33:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2025-01-09 22:33:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 193 states have internal predecessors, (252), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 32 states have call predecessors, (41), 23 states have call successors, (41) [2025-01-09 22:33:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-01-09 22:33:22,914 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 51 [2025-01-09 22:33:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:22,914 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-01-09 22:33:22,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:33:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-01-09 22:33:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:33:22,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:22,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:22,921 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-01-09 22:33:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:33:23,119 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 606123596, now seen corresponding path program 2 times [2025-01-09 22:33:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372522302] [2025-01-09 22:33:23,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:23,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:33:23,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:33:23,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:23,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:33:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372522302] [2025-01-09 22:33:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372522302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399846913] [2025-01-09 22:33:24,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:24,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:24,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:24,065 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-01-09 22:33:24,066 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-01-09 22:33:24,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:33:24,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:33:24,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:24,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:24,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:33:24,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:24,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:33:24,175 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-01-09 22:33:24,218 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2025-01-09 22:33:24,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:24,293 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_90 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_90 1))) (and (= (select .cse0 alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store (store |c_old(#length)| v_alloc_and_zero_internal_~pi~1.base_90 (select |c_#length| v_alloc_and_zero_internal_~pi~1.base_90)) alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_90) 0)))) is different from true [2025-01-09 22:33:24,352 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:33:24,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:24,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 214 [2025-01-09 22:33:24,763 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2025-01-09 22:33:24,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 112 [2025-01-09 22:33:26,283 INFO L349 Elim1Store]: treesize reduction 125, result has 3.8 percent of original size [2025-01-09 22:33:26,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 19 [2025-01-09 22:33:26,315 INFO L349 Elim1Store]: treesize reduction 145, result has 0.7 percent of original size [2025-01-09 22:33:26,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 1 [2025-01-09 22:33:26,349 INFO L349 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2025-01-09 22:33:26,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 1 [2025-01-09 22:33:26,427 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2025-01-09 22:33:26,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 19 [2025-01-09 22:33:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 23 not checked. [2025-01-09 22:33:26,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399846913] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:26,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 22 [2025-01-09 22:33:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969084297] [2025-01-09 22:33:26,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:33:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:26,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:33:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=346, Unknown=4, NotChecked=164, Total=600 [2025-01-09 22:33:26,825 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:28,259 INFO L93 Difference]: Finished difference Result 304 states and 422 transitions. [2025-01-09 22:33:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:33:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2025-01-09 22:33:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:28,261 INFO L225 Difference]: With dead ends: 304 [2025-01-09 22:33:28,261 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 22:33:28,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=636, Unknown=4, NotChecked=220, Total=992 [2025-01-09 22:33:28,262 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 135 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:28,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 485 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 965 Invalid, 0 Unknown, 973 Unchecked, 0.9s Time] [2025-01-09 22:33:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 22:33:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 244. [2025-01-09 22:33:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 202 states have internal predecessors, (265), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (51), 35 states have call predecessors, (51), 24 states have call successors, (51) [2025-01-09 22:33:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 340 transitions. [2025-01-09 22:33:28,267 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 340 transitions. Word has length 49 [2025-01-09 22:33:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 340 transitions. [2025-01-09 22:33:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 19 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 340 transitions. [2025-01-09 22:33:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:33:28,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:28,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:28,275 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-01-09 22:33:28,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:28,469 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 606123595, now seen corresponding path program 2 times [2025-01-09 22:33:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 22:33:28,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:28,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:33:28,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:33:28,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:33:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-01-09 22:33:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124239218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67981701] [2025-01-09 22:33:29,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:33:29,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:29,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:29,258 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-01-09 22:33:29,259 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-01-09 22:33:29,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 22:33:29,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:33:29,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:33:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:29,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:33:29,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:29,355 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-01-09 22:33:29,367 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:29,386 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_110 Int) (alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_110 1) alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:29,408 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_110 Int) (v_alloc_and_zero_internal_~pi~1.base_111 Int) (alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_110 1) v_alloc_and_zero_internal_~pi~1.base_111 1) alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:33:29,446 INFO L349 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2025-01-09 22:33:29,446 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 3 case distinctions, treesize of input 18 treesize of output 24 [2025-01-09 22:33:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 11 not checked. [2025-01-09 22:33:29,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:29,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67981701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:29,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:29,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 22 [2025-01-09 22:33:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471269366] [2025-01-09 22:33:29,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:33:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:29,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:33:29,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=345, Unknown=3, NotChecked=120, Total=552 [2025-01-09 22:33:29,590 INFO L87 Difference]: Start difference. First operand 244 states and 340 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:30,741 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2025-01-09 22:33:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:33:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2025-01-09 22:33:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:30,742 INFO L225 Difference]: With dead ends: 275 [2025-01-09 22:33:30,742 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 22:33:30,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=811, Unknown=3, NotChecked=192, Total=1260 [2025-01-09 22:33:30,743 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 112 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:30,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 824 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 941 Invalid, 0 Unknown, 630 Unchecked, 0.6s Time] [2025-01-09 22:33:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 22:33:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 233. [2025-01-09 22:33:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 165 states have (on average 1.496969696969697) internal successors, (247), 195 states have internal predecessors, (247), 24 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (42), 31 states have call predecessors, (42), 24 states have call successors, (42) [2025-01-09 22:33:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 313 transitions. [2025-01-09 22:33:30,748 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 313 transitions. Word has length 49 [2025-01-09 22:33:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 313 transitions. [2025-01-09 22:33:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 22:33:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 313 transitions. [2025-01-09 22:33:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:33:30,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:30,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:30,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:33:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:30,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -538809468, now seen corresponding path program 1 times [2025-01-09 22:33:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622896233] [2025-01-09 22:33:30,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:30,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:33:30,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:33:30,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:30,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622896233] [2025-01-09 22:33:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622896233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360590372] [2025-01-09 22:33:31,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:31,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:31,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:33:32,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:33:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:33:32,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:32,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 22:33:32,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:32,047 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-01-09 22:33:32,181 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 11 treesize of output 7 [2025-01-09 22:33:32,184 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 11 treesize of output 7 [2025-01-09 22:33:32,420 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:33:32,420 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-01-09 22:33:32,478 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 33 treesize of output 17 [2025-01-09 22:33:32,491 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 33 treesize of output 17 [2025-01-09 22:33:32,572 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-01-09 22:33:32,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:32,618 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-09 22:33:32,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 51 [2025-01-09 22:33:32,633 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-01-09 22:33:32,633 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 22 treesize of output 24 [2025-01-09 22:33:32,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2025-01-09 22:33:32,706 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2025-01-09 22:33:32,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 34 [2025-01-09 22:33:32,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-01-09 22:33:33,105 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:33,110 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-01-09 22:33:33,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2025-01-09 22:33:33,120 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:33:33,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2025-01-09 22:33:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-01-09 22:33:33,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360590372] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:38,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 48 [2025-01-09 22:33:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366892416] [2025-01-09 22:33:38,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:38,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:33:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:38,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:33:38,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2818, Unknown=2, NotChecked=106, Total=3080 [2025-01-09 22:33:38,232 INFO L87 Difference]: Start difference. First operand 233 states and 313 transitions. Second operand has 48 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 36 states have internal predecessors, (80), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:33:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:41,339 INFO L93 Difference]: Finished difference Result 271 states and 360 transitions. [2025-01-09 22:33:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:33:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 36 states have internal predecessors, (80), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 54 [2025-01-09 22:33:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:41,341 INFO L225 Difference]: With dead ends: 271 [2025-01-09 22:33:41,341 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 22:33:41,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=297, Invalid=5405, Unknown=2, NotChecked=148, Total=5852 [2025-01-09 22:33:41,342 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 100 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 3660 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:41,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2726 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3660 Invalid, 0 Unknown, 187 Unchecked, 1.9s Time] [2025-01-09 22:33:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 22:33:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2025-01-09 22:33:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 181 states have (on average 1.4640883977900552) internal successors, (265), 211 states have internal predecessors, (265), 26 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (46), 33 states have call predecessors, (46), 26 states have call successors, (46) [2025-01-09 22:33:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 337 transitions. [2025-01-09 22:33:41,348 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 337 transitions. Word has length 54 [2025-01-09 22:33:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:41,348 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 337 transitions. [2025-01-09 22:33:41,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 36 states have internal predecessors, (80), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:33:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 337 transitions. [2025-01-09 22:33:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:33:41,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:41,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:41,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:41,549 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1793645380, now seen corresponding path program 1 times [2025-01-09 22:33:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:41,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60538354] [2025-01-09 22:33:41,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:41,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:41,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:33:41,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:33:41,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:41,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:33:41,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60538354] [2025-01-09 22:33:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60538354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:41,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 22:33:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325902869] [2025-01-09 22:33:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:41,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:33:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:41,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:33:41,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:33:41,873 INFO L87 Difference]: Start difference. First operand 252 states and 337 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:42,453 INFO L93 Difference]: Finished difference Result 273 states and 359 transitions. [2025-01-09 22:33:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:33:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2025-01-09 22:33:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:42,456 INFO L225 Difference]: With dead ends: 273 [2025-01-09 22:33:42,456 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 22:33:42,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:33:42,458 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 33 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:42,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1554 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:33:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 22:33:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2025-01-09 22:33:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 220 states have internal predecessors, (279), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2025-01-09 22:33:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 353 transitions. [2025-01-09 22:33:42,467 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 353 transitions. Word has length 58 [2025-01-09 22:33:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:42,468 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 353 transitions. [2025-01-09 22:33:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2025-01-09 22:33:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:33:42,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:42,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:42,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:33:42,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:42,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1793645379, now seen corresponding path program 1 times [2025-01-09 22:33:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373404745] [2025-01-09 22:33:42,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:42,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:33:42,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:33:42,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:33:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373404745] [2025-01-09 22:33:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373404745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 22:33:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330841358] [2025-01-09 22:33:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:42,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:33:42,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:42,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:33:42,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:33:42,862 INFO L87 Difference]: Start difference. First operand 263 states and 353 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:43,400 INFO L93 Difference]: Finished difference Result 273 states and 358 transitions. [2025-01-09 22:33:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:33:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2025-01-09 22:33:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:43,401 INFO L225 Difference]: With dead ends: 273 [2025-01-09 22:33:43,401 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 22:33:43,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:33:43,402 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 32 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:43,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1639 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:33:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 22:33:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2025-01-09 22:33:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4631578947368422) internal successors, (278), 220 states have internal predecessors, (278), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2025-01-09 22:33:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2025-01-09 22:33:43,409 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 58 [2025-01-09 22:33:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:43,409 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2025-01-09 22:33:43,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:33:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2025-01-09 22:33:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 22:33:43,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:43,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:33:43,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:33:43,410 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2025-01-09 22:33:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash -738107489, now seen corresponding path program 1 times [2025-01-09 22:33:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409853915] [2025-01-09 22:33:43,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:33:43,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:33:43,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:43,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:33:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409853915] [2025-01-09 22:33:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409853915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641225810] [2025-01-09 22:33:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:45,065 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:33:45,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:33:45,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 22:33:45,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 22:33:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:45,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 22:33:45,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:45,205 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-01-09 22:33:45,261 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-01-09 22:33:45,477 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2025-01-09 22:33:45,592 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base)) create_internal_~now~0.base (select |c_#memory_$Pointer$#0.base| create_internal_~now~0.base))) (= |c_#valid| (store (store |c_old(#valid)| create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base)) alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))))) (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= |c_#valid| (store |c_old(#valid)| create_internal_~now~0.base 1)) (= (store |c_old(#memory_$Pointer$#0.base)| create_internal_~now~0.base (select |c_#memory_$Pointer$#0.base| create_internal_~now~0.base)) |c_#memory_$Pointer$#0.base|)))) is different from true [2025-01-09 22:33:45,768 INFO L349 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2025-01-09 22:33:45,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 95 [2025-01-09 22:33:45,897 INFO L349 Elim1Store]: treesize reduction 289, result has 24.9 percent of original size [2025-01-09 22:33:45,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 58 treesize of output 154 [2025-01-09 22:33:46,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:46,142 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-09 22:33:46,142 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 3 case distinctions, treesize of input 26 treesize of output 5 [2025-01-09 22:33:46,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:46,180 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:46,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2025-01-09 22:33:46,617 INFO L349 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2025-01-09 22:33:46,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 127 [2025-01-09 22:33:46,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:46,690 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:33:46,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 22:33:46,850 INFO L349 Elim1Store]: treesize reduction 152, result has 42.0 percent of original size [2025-01-09 22:33:46,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 192 treesize of output 305 [2025-01-09 22:33:50,206 INFO L349 Elim1Store]: treesize reduction 116, result has 17.7 percent of original size [2025-01-09 22:33:50,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 76 [2025-01-09 22:33:50,240 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,256 INFO L349 Elim1Store]: treesize reduction 67, result has 6.9 percent of original size [2025-01-09 22:33:50,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 17 [2025-01-09 22:33:50,277 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,286 INFO L349 Elim1Store]: treesize reduction 31, result has 20.5 percent of original size [2025-01-09 22:33:50,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 20 [2025-01-09 22:33:50,323 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,327 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:33:50,327 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 3 case distinctions, treesize of input 22 treesize of output 7 [2025-01-09 22:33:50,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,411 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,421 INFO L349 Elim1Store]: treesize reduction 44, result has 15.4 percent of original size [2025-01-09 22:33:50,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 31 [2025-01-09 22:33:50,586 INFO L349 Elim1Store]: treesize reduction 356, result has 9.0 percent of original size [2025-01-09 22:33:50,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 111 treesize of output 151 [2025-01-09 22:33:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,779 INFO L349 Elim1Store]: treesize reduction 147, result has 3.3 percent of original size [2025-01-09 22:33:50,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 54 treesize of output 27 [2025-01-09 22:33:50,932 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,935 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:33:50,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2025-01-09 22:33:50,974 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:50,983 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-09 22:33:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 19 [2025-01-09 22:33:51,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,010 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-09 22:33:51,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 17 [2025-01-09 22:33:51,029 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,029 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,049 INFO L349 Elim1Store]: treesize reduction 69, result has 16.9 percent of original size [2025-01-09 22:33:51,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 34 [2025-01-09 22:33:51,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 22:33:51,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,346 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:33:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 14 [2025-01-09 22:33:51,425 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,433 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-01-09 22:33:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 22 [2025-01-09 22:33:51,450 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,459 INFO L349 Elim1Store]: treesize reduction 31, result has 20.5 percent of original size [2025-01-09 22:33:51,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 22 [2025-01-09 22:33:51,477 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,480 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:33:51,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 22:33:51,592 INFO L349 Elim1Store]: treesize reduction 240, result has 14.6 percent of original size [2025-01-09 22:33:51,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 69 treesize of output 108 [2025-01-09 22:33:51,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,648 INFO L349 Elim1Store]: treesize reduction 119, result has 6.3 percent of original size [2025-01-09 22:33:51,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 25 [2025-01-09 22:33:51,715 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,717 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:33:51,717 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 3 case distinctions, treesize of input 26 treesize of output 11 [2025-01-09 22:33:51,743 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,744 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:51,755 INFO L349 Elim1Store]: treesize reduction 42, result has 16.0 percent of original size [2025-01-09 22:33:51,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 26 [2025-01-09 22:33:52,301 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:52,325 INFO L349 Elim1Store]: treesize reduction 34, result has 42.4 percent of original size [2025-01-09 22:33:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:33:52,787 INFO L349 Elim1Store]: treesize reduction 482, result has 19.3 percent of original size [2025-01-09 22:33:52,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 277 treesize of output 430 [2025-01-09 22:34:02,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,195 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,200 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-01-09 22:34:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 45 [2025-01-09 22:34:02,227 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,230 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,231 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,252 INFO L349 Elim1Store]: treesize reduction 90, result has 10.9 percent of original size [2025-01-09 22:34:02,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 53 [2025-01-09 22:34:02,305 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,338 INFO L349 Elim1Store]: treesize reduction 149, result has 6.9 percent of original size [2025-01-09 22:34:02,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 61 treesize of output 53 [2025-01-09 22:34:02,377 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,381 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,382 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,382 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,433 INFO L349 Elim1Store]: treesize reduction 241, result has 7.7 percent of original size [2025-01-09 22:34:02,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 66 treesize of output 65 [2025-01-09 22:34:02,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:02,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,500 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,515 INFO L349 Elim1Store]: treesize reduction 78, result has 9.3 percent of original size [2025-01-09 22:34:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 468 treesize of output 447 [2025-01-09 22:34:02,615 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,664 INFO L349 Elim1Store]: treesize reduction 152, result has 12.6 percent of original size [2025-01-09 22:34:02,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 2019 treesize of output 2009 [2025-01-09 22:34:02,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,884 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2025-01-09 22:34:02,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 272 treesize of output 251 [2025-01-09 22:34:02,983 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,987 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:02,988 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,013 INFO L349 Elim1Store]: treesize reduction 120, result has 10.4 percent of original size [2025-01-09 22:34:03,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 65 treesize of output 56 [2025-01-09 22:34:03,090 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,091 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,113 INFO L349 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2025-01-09 22:34:03,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 52 [2025-01-09 22:34:03,134 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,177 INFO L349 Elim1Store]: treesize reduction 202, result has 5.2 percent of original size [2025-01-09 22:34:03,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 167 treesize of output 148 [2025-01-09 22:34:03,276 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,289 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2025-01-09 22:34:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 28 [2025-01-09 22:34:03,358 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,360 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,364 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2025-01-09 22:34:03,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 20 [2025-01-09 22:34:03,462 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,464 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,473 INFO L349 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2025-01-09 22:34:03,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 20 [2025-01-09 22:34:03,491 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,491 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,493 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:03,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,518 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,530 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,544 INFO L349 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2025-01-09 22:34:03,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 20 [2025-01-09 22:34:03,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,577 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:03,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,613 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,614 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,616 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:03,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,646 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:03,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,666 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,669 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:03,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,734 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,735 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,746 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2025-01-09 22:34:03,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 20 [2025-01-09 22:34:03,785 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,785 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,788 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:03,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 22:34:03,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,862 INFO L349 Elim1Store]: treesize reduction 86, result has 5.5 percent of original size [2025-01-09 22:34:03,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 20 [2025-01-09 22:34:03,967 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:03,967 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,025 INFO L349 Elim1Store]: treesize reduction 242, result has 11.4 percent of original size [2025-01-09 22:34:04,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 72 treesize of output 78 [2025-01-09 22:34:04,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,311 INFO L349 Elim1Store]: treesize reduction 290, result has 8.8 percent of original size [2025-01-09 22:34:04,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 68 treesize of output 75 [2025-01-09 22:34:04,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,417 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,456 INFO L349 Elim1Store]: treesize reduction 176, result has 7.4 percent of original size [2025-01-09 22:34:04,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 1139 treesize of output 1121 [2025-01-09 22:34:04,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,615 INFO L349 Elim1Store]: treesize reduction 144, result has 7.1 percent of original size [2025-01-09 22:34:04,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 55 [2025-01-09 22:34:04,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,658 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,663 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2025-01-09 22:34:04,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 135 [2025-01-09 22:34:04,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:04,727 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,727 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,728 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,734 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2025-01-09 22:34:04,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 223 [2025-01-09 22:34:04,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,890 INFO L349 Elim1Store]: treesize reduction 134, result has 14.6 percent of original size [2025-01-09 22:34:04,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 60 treesize of output 62 [2025-01-09 22:34:04,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:04,962 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2025-01-09 22:34:04,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 243 [2025-01-09 22:34:05,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,069 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2025-01-09 22:34:05,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,101 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,102 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:05,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 44 [2025-01-09 22:34:05,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:05,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,182 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,184 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 76 [2025-01-09 22:34:05,230 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,230 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,231 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,234 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,257 INFO L349 Elim1Store]: treesize reduction 95, result has 13.6 percent of original size [2025-01-09 22:34:05,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 52 [2025-01-09 22:34:05,333 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,338 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,382 INFO L349 Elim1Store]: treesize reduction 134, result has 14.6 percent of original size [2025-01-09 22:34:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 57 treesize of output 62 [2025-01-09 22:34:05,447 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,448 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,448 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,450 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:05,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 44 [2025-01-09 22:34:05,474 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,475 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,493 INFO L349 Elim1Store]: treesize reduction 86, result has 5.5 percent of original size [2025-01-09 22:34:05,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 269 treesize of output 250 [2025-01-09 22:34:05,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,578 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:05,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-01-09 22:34:05,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,631 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,634 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 17 [2025-01-09 22:34:05,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,766 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:05,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 44 [2025-01-09 22:34:05,799 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,799 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,815 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-09 22:34:05,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 38 [2025-01-09 22:34:05,865 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,867 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,869 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,887 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-01-09 22:34:05,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 52 [2025-01-09 22:34:05,949 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,963 INFO L349 Elim1Store]: treesize reduction 84, result has 5.6 percent of original size [2025-01-09 22:34:05,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 157 treesize of output 140 [2025-01-09 22:34:05,999 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:05,999 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,020 INFO L349 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2025-01-09 22:34:06,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 269 treesize of output 250 [2025-01-09 22:34:06,068 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,070 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,081 INFO L349 Elim1Store]: treesize reduction 45, result has 10.0 percent of original size [2025-01-09 22:34:06,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 40 [2025-01-09 22:34:06,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:06,101 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,101 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,104 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:06,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 76 [2025-01-09 22:34:06,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,139 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:34:06,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2025-01-09 22:34:06,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,217 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:34:06,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 44 [2025-01-09 22:34:06,278 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,280 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,280 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,307 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2025-01-09 22:34:06,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 52 [2025-01-09 22:34:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,353 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,358 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-01-09 22:34:06,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 40 [2025-01-09 22:34:06,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,448 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,460 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2025-01-09 22:34:06,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 272 treesize of output 251 [2025-01-09 22:34:06,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,506 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:06,524 INFO L349 Elim1Store]: treesize reduction 96, result has 5.0 percent of original size [2025-01-09 22:34:06,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 162 treesize of output 140 [2025-01-09 22:34:15,582 INFO L349 Elim1Store]: treesize reduction 2017, result has 16.5 percent of original size [2025-01-09 22:34:15,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 83 case distinctions, treesize of input 187 treesize of output 644