./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:36:05,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:36:05,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:36:05,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:36:05,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:36:05,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:36:05,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:36:05,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:36:05,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:36:05,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:36:05,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:36:05,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:36:05,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:36:05,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:36:05,841 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:36:05,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:36:05,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:36:05,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:36:05,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:36:05,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:36:05,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:36:05,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:36:05,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:36:05,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:36:05,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:36:05,845 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2025-01-09 22:36:06,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:36:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:36:06,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:36:06,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:36:06,081 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:36:06,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2025-01-09 22:36:07,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b207527a4/a9444491a97c4444b566c173bf95ebc6/FLAG14af15217 [2025-01-09 22:36:07,520 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:36:07,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2025-01-09 22:36:07,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b207527a4/a9444491a97c4444b566c173bf95ebc6/FLAG14af15217 [2025-01-09 22:36:07,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b207527a4/a9444491a97c4444b566c173bf95ebc6 [2025-01-09 22:36:07,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:36:07,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:36:07,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:36:07,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:36:07,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:36:07,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c61e2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07, skipping insertion in model container [2025-01-09 22:36:07,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:36:07,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:36:07,782 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:36:07,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:36:07,843 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:36:07,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07 WrapperNode [2025-01-09 22:36:07,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:36:07,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:36:07,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:36:07,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:36:07,849 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:36:07" (1/1) ... [2025-01-09 22:36:07,855 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:36:07" (1/1) ... [2025-01-09 22:36:07,875 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 183 [2025-01-09 22:36:07,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:36:07,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:36:07,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:36:07,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:36:07,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,907 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-01-09 22:36:07,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:36:07,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:36:07,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:36:07,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:36:07,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (1/1) ... [2025-01-09 22:36:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:36:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:07,966 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:36:07,973 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:36:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:36:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:36:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:36:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:36:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:36:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:36:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:36:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:36:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:36:08,098 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:36:08,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:36:08,497 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 22:36:08,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:36:08,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:36:08,513 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 22:36:08,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:36:08 BoogieIcfgContainer [2025-01-09 22:36:08,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:36:08,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:36:08,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:36:08,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:36:08,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:36:07" (1/3) ... [2025-01-09 22:36:08,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308e24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:36:08, skipping insertion in model container [2025-01-09 22:36:08,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:36:07" (2/3) ... [2025-01-09 22:36:08,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7308e24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:36:08, skipping insertion in model container [2025-01-09 22:36:08,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:36:08" (3/3) ... [2025-01-09 22:36:08,522 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2025-01-09 22:36:08,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:36:08,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 2 procedures, 183 locations, 1 initial locations, 12 loop locations, and 75 error locations. [2025-01-09 22:36:08,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:36:08,574 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;@2d76d6de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:36:08,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-01-09 22:36:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 100 states have (on average 2.1) internal successors, (210), 175 states have internal predecessors, (210), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:36:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:36:08,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:08,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:36:08,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2025-01-09 22:36:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-01-09 22:36:08,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:08,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:36:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:36:08,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:08,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:08,756 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:36:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:08,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-01-09 22:36:08,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867265721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:08,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:08,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:36:08,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146004549] [2025-01-09 22:36:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:08,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:08,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:08,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:08,784 INFO L87 Difference]: Start difference. First operand has 183 states, 100 states have (on average 2.1) internal successors, (210), 175 states have internal predecessors, (210), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:08,933 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2025-01-09 22:36:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:36:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:08,939 INFO L225 Difference]: With dead ends: 172 [2025-01-09 22:36:08,940 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 22:36:08,941 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:36:08,943 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 157 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:08,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 122 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 22:36:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 22:36:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 92 states have (on average 1.9565217391304348) internal successors, (180), 168 states have internal predecessors, (180), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2025-01-09 22:36:08,981 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 3 [2025-01-09 22:36:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:08,981 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2025-01-09 22:36:08,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2025-01-09 22:36:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:36:08,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:08,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:36:08,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:36:08,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:08,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2025-01-09 22:36:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-01-09 22:36:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:36:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:36:08,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:08,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:09,045 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:36:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-01-09 22:36:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669520866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:09,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:36:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711010228] [2025-01-09 22:36:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:09,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:09,047 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:09,162 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2025-01-09 22:36:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-09 22:36:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:09,164 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:36:09,164 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:36:09,164 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:36:09,164 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 157 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:09,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 118 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:36:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-09 22:36:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 92 states have (on average 1.923913043478261) internal successors, (177), 165 states have internal predecessors, (177), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 183 transitions. [2025-01-09 22:36:09,173 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 183 transitions. Word has length 3 [2025-01-09 22:36:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:09,173 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 183 transitions. [2025-01-09 22:36:09,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 183 transitions. [2025-01-09 22:36:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:36:09,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:09,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:09,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:36:09,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703282, now seen corresponding path program 1 times [2025-01-09 22:36:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620685149] [2025-01-09 22:36:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:36:09,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:36:09,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:09,342 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:36:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620685149] [2025-01-09 22:36:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620685149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:36:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044524536] [2025-01-09 22:36:09,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:36:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:36:09,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:36:09,344 INFO L87 Difference]: Start difference. First operand 167 states and 183 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:09,508 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2025-01-09 22:36:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:36:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:09,509 INFO L225 Difference]: With dead ends: 165 [2025-01-09 22:36:09,510 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 22:36:09,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:09,510 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 244 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:09,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 93 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 22:36:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-01-09 22:36:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.7358490566037736) internal successors, (184), 161 states have internal predecessors, (184), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2025-01-09 22:36:09,522 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 10 [2025-01-09 22:36:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:09,522 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2025-01-09 22:36:09,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2025-01-09 22:36:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:36:09,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:09,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:36:09,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703281, now seen corresponding path program 1 times [2025-01-09 22:36:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691753198] [2025-01-09 22:36:09,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:09,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:36:09,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:36:09,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:09,747 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:36:09,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:09,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691753198] [2025-01-09 22:36:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691753198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:09,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:09,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:36:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983003934] [2025-01-09 22:36:09,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:09,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:36:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:09,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:36:09,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:36:09,749 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:10,013 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2025-01-09 22:36:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:10,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:36:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:10,015 INFO L225 Difference]: With dead ends: 236 [2025-01-09 22:36:10,015 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 22:36:10,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:36:10,016 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 377 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:10,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 136 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 22:36:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2025-01-09 22:36:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.625) internal successors, (260), 215 states have internal predecessors, (260), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions. [2025-01-09 22:36:10,023 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 10 [2025-01-09 22:36:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:10,023 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 266 transitions. [2025-01-09 22:36:10,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions. [2025-01-09 22:36:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:36:10,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:10,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:36:10,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash 944029049, now seen corresponding path program 1 times [2025-01-09 22:36:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134547564] [2025-01-09 22:36:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:10,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:36:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:36:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:10,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,059 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:36:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134547564] [2025-01-09 22:36:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134547564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:36:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229904475] [2025-01-09 22:36:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:10,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:10,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:10,060 INFO L87 Difference]: Start difference. First operand 217 states and 266 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:10,080 INFO L93 Difference]: Finished difference Result 262 states and 314 transitions. [2025-01-09 22:36:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:36:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:10,081 INFO L225 Difference]: With dead ends: 262 [2025-01-09 22:36:10,081 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 22:36:10,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:10,083 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 55 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:10,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 334 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:36:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 22:36:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2025-01-09 22:36:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 174 states have (on average 1.6149425287356323) internal successors, (281), 229 states have internal predecessors, (281), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 287 transitions. [2025-01-09 22:36:10,096 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 287 transitions. Word has length 13 [2025-01-09 22:36:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:10,097 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 287 transitions. [2025-01-09 22:36:10,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 287 transitions. [2025-01-09 22:36:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:36:10,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:10,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:10,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:36:10,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 847221851, now seen corresponding path program 1 times [2025-01-09 22:36:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107332055] [2025-01-09 22:36:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:36:10,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:36:10,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:10,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,206 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:36:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107332055] [2025-01-09 22:36:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107332055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118844418] [2025-01-09 22:36:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:36:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:36:10,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:10,207 INFO L87 Difference]: Start difference. First operand 231 states and 287 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:10,342 INFO L93 Difference]: Finished difference Result 230 states and 284 transitions. [2025-01-09 22:36:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:36:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:10,343 INFO L225 Difference]: With dead ends: 230 [2025-01-09 22:36:10,343 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 22:36:10,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:36:10,343 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:10,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 431 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 22:36:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-01-09 22:36:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 228 states have internal predecessors, (278), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 284 transitions. [2025-01-09 22:36:10,349 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 284 transitions. Word has length 13 [2025-01-09 22:36:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:10,349 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 284 transitions. [2025-01-09 22:36:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 284 transitions. [2025-01-09 22:36:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:36:10,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:10,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:10,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:36:10,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash 847221852, now seen corresponding path program 1 times [2025-01-09 22:36:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025438082] [2025-01-09 22:36:10,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:10,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:36:10,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:36:10,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,495 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:36:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025438082] [2025-01-09 22:36:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025438082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768999309] [2025-01-09 22:36:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:10,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:36:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:36:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:10,497 INFO L87 Difference]: Start difference. First operand 230 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:10,655 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2025-01-09 22:36:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:36:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:10,656 INFO L225 Difference]: With dead ends: 229 [2025-01-09 22:36:10,656 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 22:36:10,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:36:10,657 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:10,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 22:36:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-01-09 22:36:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 174 states have (on average 1.5804597701149425) internal successors, (275), 227 states have internal predecessors, (275), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 281 transitions. [2025-01-09 22:36:10,667 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 281 transitions. Word has length 13 [2025-01-09 22:36:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:10,667 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 281 transitions. [2025-01-09 22:36:10,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 281 transitions. [2025-01-09 22:36:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:36:10,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:10,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:10,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:36:10,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 94244445, now seen corresponding path program 1 times [2025-01-09 22:36:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-01-09 22:36:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:36:10,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:36:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:10,832 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:36:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-01-09 22:36:10,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137134184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:10,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:36:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796609672] [2025-01-09 22:36:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:36:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:10,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:36:10,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:10,834 INFO L87 Difference]: Start difference. First operand 229 states and 281 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:11,150 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2025-01-09 22:36:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:36:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:36:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:11,154 INFO L225 Difference]: With dead ends: 228 [2025-01-09 22:36:11,154 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 22:36:11,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:36:11,155 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 236 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:11,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 338 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 22:36:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-01-09 22:36:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.5689655172413792) internal successors, (273), 226 states have internal predecessors, (273), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 279 transitions. [2025-01-09 22:36:11,159 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 279 transitions. Word has length 17 [2025-01-09 22:36:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 279 transitions. [2025-01-09 22:36:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2025-01-09 22:36:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:36:11,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:11,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:11,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:36:11,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 94244446, now seen corresponding path program 1 times [2025-01-09 22:36:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018655129] [2025-01-09 22:36:11,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:11,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:36:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:36:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:11,441 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:36:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:11,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018655129] [2025-01-09 22:36:11,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018655129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:11,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:11,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:36:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307139747] [2025-01-09 22:36:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:36:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:11,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:36:11,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:36:11,442 INFO L87 Difference]: Start difference. First operand 228 states and 279 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:11,875 INFO L93 Difference]: Finished difference Result 222 states and 269 transitions. [2025-01-09 22:36:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:36:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:36:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:11,876 INFO L225 Difference]: With dead ends: 222 [2025-01-09 22:36:11,876 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 22:36:11,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:36:11,877 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 245 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:11,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 412 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:36:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 22:36:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2025-01-09 22:36:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 165 states have (on average 1.5393939393939393) internal successors, (254), 211 states have internal predecessors, (254), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 260 transitions. [2025-01-09 22:36:11,881 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 260 transitions. Word has length 17 [2025-01-09 22:36:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:11,881 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 260 transitions. [2025-01-09 22:36:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 260 transitions. [2025-01-09 22:36:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:36:11,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:11,881 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:36:11,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2048847490, now seen corresponding path program 1 times [2025-01-09 22:36:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402335459] [2025-01-09 22:36:11,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:11,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:36:11,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:36:11,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:11,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402335459] [2025-01-09 22:36:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402335459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:36:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455131718] [2025-01-09 22:36:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:11,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:36:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:11,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:36:11,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:36:11,936 INFO L87 Difference]: Start difference. First operand 213 states and 260 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:36:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:12,026 INFO L93 Difference]: Finished difference Result 237 states and 269 transitions. [2025-01-09 22:36:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:36:12,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2025-01-09 22:36:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:12,027 INFO L225 Difference]: With dead ends: 237 [2025-01-09 22:36:12,027 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 22:36:12,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:36:12,028 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 265 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:12,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 211 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 22:36:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 212. [2025-01-09 22:36:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.5212121212121212) internal successors, (251), 210 states have internal predecessors, (251), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2025-01-09 22:36:12,032 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 28 [2025-01-09 22:36:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2025-01-09 22:36:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:36:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2025-01-09 22:36:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:36:12,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:12,033 INFO L218 NwaCegarLoop]: trace histogram [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:36:12,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:36:12,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:12,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -952821515, now seen corresponding path program 1 times [2025-01-09 22:36:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498860675] [2025-01-09 22:36:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:12,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:36:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:36:12,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:12,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498860675] [2025-01-09 22:36:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498860675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881421163] [2025-01-09 22:36:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:12,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:12,402 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:36:12,404 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:36:12,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:36:12,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:36:12,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:36:12,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:12,526 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:36:12,648 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:36:12,649 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:36:12,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:12,827 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:12,827 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:36:12,975 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:12,975 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 1 case distinctions, treesize of input 33 treesize of output 24 [2025-01-09 22:36:13,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:13,038 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:36:13,203 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 25 treesize of output 13 [2025-01-09 22:36:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:13,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:13,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (v_ArrVal_334 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_73| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|))) is different from false [2025-01-09 22:36:13,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (v_ArrVal_334 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_73| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|))) is different from false [2025-01-09 22:36:13,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:13,633 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2025-01-09 22:36:13,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2025-01-09 22:36:13,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2025-01-09 22:36:13,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:13,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2025-01-09 22:36:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881421163] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2025-01-09 22:36:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963375723] [2025-01-09 22:36:16,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:16,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:36:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:36:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=836, Unknown=12, NotChecked=122, Total=1122 [2025-01-09 22:36:16,110 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:17,371 INFO L93 Difference]: Finished difference Result 323 states and 367 transitions. [2025-01-09 22:36:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:36:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:36:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:17,373 INFO L225 Difference]: With dead ends: 323 [2025-01-09 22:36:17,373 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 22:36:17,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=1217, Unknown=12, NotChecked=150, Total=1640 [2025-01-09 22:36:17,374 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 512 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1454 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1898 Invalid, 0 Unknown, 657 Unchecked, 1.1s Time] [2025-01-09 22:36:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 22:36:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 238. [2025-01-09 22:36:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 191 states have (on average 1.4764397905759161) internal successors, (282), 236 states have internal predecessors, (282), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 287 transitions. [2025-01-09 22:36:17,389 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 287 transitions. Word has length 32 [2025-01-09 22:36:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:17,389 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 287 transitions. [2025-01-09 22:36:17,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 287 transitions. [2025-01-09 22:36:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:36:17,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:17,390 INFO L218 NwaCegarLoop]: trace histogram [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:36:17,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:36:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:36:17,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -952821514, now seen corresponding path program 1 times [2025-01-09 22:36:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570206451] [2025-01-09 22:36:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:17,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:36:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:36:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:17,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570206451] [2025-01-09 22:36:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570206451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160159962] [2025-01-09 22:36:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:18,032 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:36:18,034 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:36:18,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:36:18,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:36:18,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:18,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:18,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:36:18,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:18,116 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:36:18,165 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:36:18,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:18,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:18,205 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:36:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:18,283 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:18,283 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:36:18,289 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 24 treesize of output 11 [2025-01-09 22:36:18,363 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:36:18,363 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:36:18,374 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:18,374 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 1 case distinctions, treesize of input 33 treesize of output 24 [2025-01-09 22:36:18,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:18,425 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:36:18,429 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 24 treesize of output 11 [2025-01-09 22:36:18,548 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 25 treesize of output 13 [2025-01-09 22:36:18,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:36:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:18,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:19,113 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)))))))) is different from false [2025-01-09 22:36:19,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) .cse1 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))))))) is different from false [2025-01-09 22:36:19,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:19,170 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2025-01-09 22:36:19,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:19,178 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2025-01-09 22:36:19,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:19,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2025-01-09 22:36:19,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:19,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1831 treesize of output 1742 [2025-01-09 22:36:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2025-01-09 22:36:19,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2025-01-09 22:36:19,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:19,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 499 treesize of output 455 [2025-01-09 22:36:19,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 447 treesize of output 439 [2025-01-09 22:36:20,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:20,313 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-01-09 22:36:20,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:20,320 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-09 22:36:20,323 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:20,325 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 28 treesize of output 20 [2025-01-09 22:36:20,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:20,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:20,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 22:36:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160159962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:20,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:20,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2025-01-09 22:36:20,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195460591] [2025-01-09 22:36:20,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:20,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:36:20,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:20,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:36:20,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=989, Unknown=18, NotChecked=130, Total=1260 [2025-01-09 22:36:20,494 INFO L87 Difference]: Start difference. First operand 238 states and 287 transitions. Second operand has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:21,701 INFO L93 Difference]: Finished difference Result 314 states and 358 transitions. [2025-01-09 22:36:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:36:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:36:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:21,702 INFO L225 Difference]: With dead ends: 314 [2025-01-09 22:36:21,702 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 22:36:21,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1598, Unknown=18, NotChecked=170, Total=2070 [2025-01-09 22:36:21,703 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1125 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:21,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1324 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2022 Invalid, 0 Unknown, 627 Unchecked, 0.9s Time] [2025-01-09 22:36:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 22:36:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 238. [2025-01-09 22:36:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 236 states have internal predecessors, (281), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2025-01-09 22:36:21,710 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 32 [2025-01-09 22:36:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:21,710 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2025-01-09 22:36:21,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2025-01-09 22:36:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:36:21,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:21,711 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:36:21,718 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:36:21,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:21,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:21,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash -824757211, now seen corresponding path program 1 times [2025-01-09 22:36:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267869875] [2025-01-09 22:36:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:36:21,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:36:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267869875] [2025-01-09 22:36:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267869875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:36:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801782510] [2025-01-09 22:36:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:21,948 INFO L87 Difference]: Start difference. First operand 238 states and 286 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:21,956 INFO L93 Difference]: Finished difference Result 240 states and 288 transitions. [2025-01-09 22:36:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 22:36:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:21,958 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:36:21,958 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 22:36:21,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:21,958 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:36:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 22:36:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-01-09 22:36:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 288 transitions. [2025-01-09 22:36:21,967 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 288 transitions. Word has length 34 [2025-01-09 22:36:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:21,967 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 288 transitions. [2025-01-09 22:36:21,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 288 transitions. [2025-01-09 22:36:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:21,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:21,968 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:21,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:36:21,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:21,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1086912086, now seen corresponding path program 1 times [2025-01-09 22:36:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:21,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083695997] [2025-01-09 22:36:21,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:21,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:21,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:22,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:22,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083695997] [2025-01-09 22:36:22,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083695997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:22,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:22,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:36:22,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220556542] [2025-01-09 22:36:22,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:22,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:36:22,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:22,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:36:22,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:36:22,095 INFO L87 Difference]: Start difference. First operand 240 states and 288 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:22,278 INFO L93 Difference]: Finished difference Result 256 states and 307 transitions. [2025-01-09 22:36:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:36:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:36:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:22,279 INFO L225 Difference]: With dead ends: 256 [2025-01-09 22:36:22,279 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 22:36:22,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:36:22,280 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 17 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:22,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 644 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 22:36:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 248. [2025-01-09 22:36:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 1.4527363184079602) internal successors, (292), 246 states have internal predecessors, (292), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 297 transitions. [2025-01-09 22:36:22,284 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 297 transitions. Word has length 37 [2025-01-09 22:36:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 297 transitions. [2025-01-09 22:36:22,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 297 transitions. [2025-01-09 22:36:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:22,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:22,285 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:36:22,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:22,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1086852504, now seen corresponding path program 1 times [2025-01-09 22:36:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862951314] [2025-01-09 22:36:22,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:22,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862951314] [2025-01-09 22:36:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862951314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:22,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:36:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470490619] [2025-01-09 22:36:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:22,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:22,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:22,324 INFO L87 Difference]: Start difference. First operand 248 states and 297 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:22,377 INFO L93 Difference]: Finished difference Result 244 states and 289 transitions. [2025-01-09 22:36:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:36:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:22,378 INFO L225 Difference]: With dead ends: 244 [2025-01-09 22:36:22,378 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 22:36:22,379 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:36:22,379 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 19 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:22,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 221 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 22:36:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-01-09 22:36:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.4129353233830846) internal successors, (284), 242 states have internal predecessors, (284), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 289 transitions. [2025-01-09 22:36:22,382 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 289 transitions. Word has length 37 [2025-01-09 22:36:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 289 transitions. [2025-01-09 22:36:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 289 transitions. [2025-01-09 22:36:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:22,383 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:36:22,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1086852503, now seen corresponding path program 1 times [2025-01-09 22:36:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837691152] [2025-01-09 22:36:22,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:22,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:22,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:22,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:22,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837691152] [2025-01-09 22:36:22,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837691152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:22,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:22,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:36:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099476978] [2025-01-09 22:36:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:22,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:36:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:22,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:36:22,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:36:22,468 INFO L87 Difference]: Start difference. First operand 244 states and 289 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:22,530 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2025-01-09 22:36:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:36:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:36:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:22,532 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:36:22,532 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 22:36:22,532 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:36:22,532 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 19 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:22,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 22:36:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-01-09 22:36:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.373134328358209) internal successors, (276), 238 states have internal predecessors, (276), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 281 transitions. [2025-01-09 22:36:22,538 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 281 transitions. Word has length 37 [2025-01-09 22:36:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:22,538 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 281 transitions. [2025-01-09 22:36:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 281 transitions. [2025-01-09 22:36:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:22,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:22,542 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:22,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:36:22,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 216765830, now seen corresponding path program 1 times [2025-01-09 22:36:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042819292] [2025-01-09 22:36:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:22,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:22,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:22,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042819292] [2025-01-09 22:36:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042819292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:36:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302846001] [2025-01-09 22:36:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:36:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:22,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:36:22,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:36:22,611 INFO L87 Difference]: Start difference. First operand 240 states and 281 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:22,776 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2025-01-09 22:36:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:36:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:36:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:22,777 INFO L225 Difference]: With dead ends: 254 [2025-01-09 22:36:22,777 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 22:36:22,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:36:22,778 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:22,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 336 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 22:36:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 239. [2025-01-09 22:36:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 201 states have (on average 1.3681592039800996) internal successors, (275), 237 states have internal predecessors, (275), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 280 transitions. [2025-01-09 22:36:22,781 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 280 transitions. Word has length 37 [2025-01-09 22:36:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 280 transitions. [2025-01-09 22:36:22,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 280 transitions. [2025-01-09 22:36:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:36:22,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:22,782 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:22,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:36:22,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:22,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash 216765831, now seen corresponding path program 1 times [2025-01-09 22:36:22,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:22,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025208000] [2025-01-09 22:36:22,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:22,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:22,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:23,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025208000] [2025-01-09 22:36:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025208000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:23,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385631453] [2025-01-09 22:36:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:23,146 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:36:23,148 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:36:23,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:36:23,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:36:23,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 22:36:23,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:23,237 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:36:23,293 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:23,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:23,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:23,326 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:36:23,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:23,397 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-01-09 22:36:23,401 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 24 treesize of output 11 [2025-01-09 22:36:23,417 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 16 treesize of output 8 [2025-01-09 22:36:23,458 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 16 treesize of output 11 [2025-01-09 22:36:23,473 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 16 treesize of output 11 [2025-01-09 22:36:23,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 22:36:23,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:36:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:23,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:23,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:23,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-01-09 22:36:24,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_773 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_85| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_85|) (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_771) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_770) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_773)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|) 1)))) is different from false [2025-01-09 22:36:24,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:24,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-01-09 22:36:24,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:24,037 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-09 22:36:24,040 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 54 treesize of output 46 [2025-01-09 22:36:24,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2025-01-09 22:36:24,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2025-01-09 22:36:24,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2025-01-09 22:36:24,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2025-01-09 22:36:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385631453] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:24,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 42 [2025-01-09 22:36:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065019055] [2025-01-09 22:36:24,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:36:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:24,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:36:24,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1554, Unknown=13, NotChecked=80, Total=1806 [2025-01-09 22:36:24,300 INFO L87 Difference]: Start difference. First operand 239 states and 280 transitions. Second operand has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:26,335 INFO L93 Difference]: Finished difference Result 440 states and 506 transitions. [2025-01-09 22:36:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-09 22:36:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:36:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:26,336 INFO L225 Difference]: With dead ends: 440 [2025-01-09 22:36:26,336 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 22:36:26,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1089, Invalid=6734, Unknown=13, NotChecked=174, Total=8010 [2025-01-09 22:36:26,338 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1540 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:26,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1891 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2217 Invalid, 0 Unknown, 420 Unchecked, 1.0s Time] [2025-01-09 22:36:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 22:36:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 266. [2025-01-09 22:36:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 264 states have internal predecessors, (306), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 311 transitions. [2025-01-09 22:36:26,343 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 311 transitions. Word has length 37 [2025-01-09 22:36:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:26,344 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 311 transitions. [2025-01-09 22:36:26,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 311 transitions. [2025-01-09 22:36:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:36:26,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:26,344 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, 1, 1, 1, 1] [2025-01-09 22:36:26,352 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:36:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:26,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -627390452, now seen corresponding path program 1 times [2025-01-09 22:36:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417669894] [2025-01-09 22:36:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:26,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:36:26,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:36:26,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:26,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417669894] [2025-01-09 22:36:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417669894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171654815] [2025-01-09 22:36:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:26,997 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:36:26,998 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:36:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:36:27,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:36:27,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:27,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:27,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:36:27,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:27,095 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:36:27,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:27,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:27,183 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:36:27,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:27,267 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:27,268 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-01-09 22:36:27,272 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 24 treesize of output 11 [2025-01-09 22:36:27,344 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:27,344 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 1 case distinctions, treesize of input 24 treesize of output 17 [2025-01-09 22:36:27,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:36:27,349 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 23 treesize of output 16 [2025-01-09 22:36:27,383 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:27,383 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2025-01-09 22:36:27,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 22:36:27,388 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 41 treesize of output 26 [2025-01-09 22:36:27,498 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 33 treesize of output 21 [2025-01-09 22:36:27,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2025-01-09 22:36:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:27,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:27,891 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 46 treesize of output 26 [2025-01-09 22:36:28,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:28,491 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-01-09 22:36:28,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:28,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2025-01-09 22:36:28,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:28,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 174 [2025-01-09 22:36:28,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:28,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2025-01-09 22:36:28,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 119 [2025-01-09 22:36:28,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2025-01-09 22:36:28,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2025-01-09 22:36:28,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 22:36:28,723 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:36:28,723 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2025-01-09 22:36:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171654815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:28,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 19] total 47 [2025-01-09 22:36:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147360873] [2025-01-09 22:36:28,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 22:36:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:28,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 22:36:28,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2012, Unknown=13, NotChecked=0, Total=2162 [2025-01-09 22:36:28,909 INFO L87 Difference]: Start difference. First operand 266 states and 311 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:30,616 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2025-01-09 22:36:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:36:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:36:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:30,618 INFO L225 Difference]: With dead ends: 316 [2025-01-09 22:36:30,618 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 22:36:30,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=417, Invalid=3992, Unknown=13, NotChecked=0, Total=4422 [2025-01-09 22:36:30,619 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 883 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:30,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1995 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 22:36:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 22:36:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 268. [2025-01-09 22:36:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 266 states have internal predecessors, (308), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 313 transitions. [2025-01-09 22:36:30,623 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 313 transitions. Word has length 41 [2025-01-09 22:36:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 313 transitions. [2025-01-09 22:36:30,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 313 transitions. [2025-01-09 22:36:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:36:30,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:30,624 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:30,630 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:36:30,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:30,825 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:30,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1745119182, now seen corresponding path program 1 times [2025-01-09 22:36:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:30,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713472906] [2025-01-09 22:36:30,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:30,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:36:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:36:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:30,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713472906] [2025-01-09 22:36:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713472906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:30,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:36:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:36:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833160632] [2025-01-09 22:36:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:36:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:30,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:36:30,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:36:30,878 INFO L87 Difference]: Start difference. First operand 268 states and 313 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:31,050 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2025-01-09 22:36:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:36:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:36:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:31,051 INFO L225 Difference]: With dead ends: 284 [2025-01-09 22:36:31,051 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 22:36:31,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:36:31,051 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 73 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:31,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 22:36:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-01-09 22:36:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 272 states have internal predecessors, (317), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2025-01-09 22:36:31,055 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 41 [2025-01-09 22:36:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:31,055 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2025-01-09 22:36:31,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2025-01-09 22:36:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:36:31,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:31,055 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:31,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:36:31,055 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1745119181, now seen corresponding path program 1 times [2025-01-09 22:36:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401958015] [2025-01-09 22:36:31,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:31,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:36:31,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:36:31,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:31,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:31,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401958015] [2025-01-09 22:36:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401958015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141128814] [2025-01-09 22:36:31,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:31,391 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:36:31,393 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:36:31,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:36:31,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:36:31,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:31,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:31,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:36:31,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:31,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 22:36:31,556 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 28 treesize of output 16 [2025-01-09 22:36:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:31,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:36:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141128814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:36:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-01-09 22:36:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91958341] [2025-01-09 22:36:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:36:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:36:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:36:31,582 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:31,718 INFO L93 Difference]: Finished difference Result 282 states and 328 transitions. [2025-01-09 22:36:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:36:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:36:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:31,719 INFO L225 Difference]: With dead ends: 282 [2025-01-09 22:36:31,719 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 22:36:31,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:36:31,720 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 36 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:31,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 412 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:36:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 22:36:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 272. [2025-01-09 22:36:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 270 states have internal predecessors, (312), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 317 transitions. [2025-01-09 22:36:31,723 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 317 transitions. Word has length 41 [2025-01-09 22:36:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 317 transitions. [2025-01-09 22:36:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 317 transitions. [2025-01-09 22:36:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:36:31,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:31,724 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:31,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:36:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:31,924 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1680796568, now seen corresponding path program 1 times [2025-01-09 22:36:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349645850] [2025-01-09 22:36:31,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:31,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:36:31,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:36:31,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:31,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349645850] [2025-01-09 22:36:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349645850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333408132] [2025-01-09 22:36:32,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:32,189 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:36:32,189 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:36:32,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:36:32,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:36:32,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:32,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:32,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:36:32,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:32,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:32,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:32,378 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 16 treesize of output 11 [2025-01-09 22:36:32,382 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 16 treesize of output 11 [2025-01-09 22:36:32,386 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 16 treesize of output 11 [2025-01-09 22:36:32,390 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 16 treesize of output 11 [2025-01-09 22:36:32,395 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 16 treesize of output 11 [2025-01-09 22:36:32,398 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 16 treesize of output 11 [2025-01-09 22:36:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:36:32,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:36:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333408132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:36:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:36:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2025-01-09 22:36:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317531033] [2025-01-09 22:36:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:36:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:36:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:32,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:36:32,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:36:32,423 INFO L87 Difference]: Start difference. First operand 272 states and 317 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:32,614 INFO L93 Difference]: Finished difference Result 286 states and 332 transitions. [2025-01-09 22:36:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:36:32,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-09 22:36:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:32,617 INFO L225 Difference]: With dead ends: 286 [2025-01-09 22:36:32,617 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 22:36:32,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:36:32,619 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 13 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:32,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 544 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:36:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 22:36:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2025-01-09 22:36:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 256 states have (on average 1.2734375) internal successors, (326), 283 states have internal predecessors, (326), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 331 transitions. [2025-01-09 22:36:32,622 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 331 transitions. Word has length 43 [2025-01-09 22:36:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:32,622 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 331 transitions. [2025-01-09 22:36:32,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 331 transitions. [2025-01-09 22:36:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:36:32,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:32,623 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:32,629 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:36:32,823 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,SelfDestructingSolverStorable21 [2025-01-09 22:36:32,823 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1733698349, now seen corresponding path program 1 times [2025-01-09 22:36:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698500849] [2025-01-09 22:36:32,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:32,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:36:32,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:36:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698500849] [2025-01-09 22:36:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698500849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523569282] [2025-01-09 22:36:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:33,131 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:36:33,133 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:36:33,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:36:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:36:33,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:33,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:33,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:36:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:33,246 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:36:33,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:33,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:33,327 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:36:33,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:33,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:33,400 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-01-09 22:36:33,406 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 24 treesize of output 11 [2025-01-09 22:36:33,421 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 16 treesize of output 8 [2025-01-09 22:36:33,458 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 16 treesize of output 11 [2025-01-09 22:36:33,474 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 16 treesize of output 11 [2025-01-09 22:36:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:33,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:33,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:36:33,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_99| Int) (v_ArrVal_1250 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_99|) (< |v_ULTIMATE.start_main_~x~0#1.offset_99| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1250) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_99|) 1)))) is different from false [2025-01-09 22:36:33,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_99| Int) (v_ArrVal_1250 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1247) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1250) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_99|) 1)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_99|) (< |v_ULTIMATE.start_main_~x~0#1.offset_99| 0))) is different from false [2025-01-09 22:36:33,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_99| Int) (v_ArrVal_1250 (Array Int Int))) (or (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1247) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1248) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1250)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_99|) 1)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_99|) (< |v_ULTIMATE.start_main_~x~0#1.offset_99| 0))) is different from false [2025-01-09 22:36:33,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:33,886 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-01-09 22:36:33,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:33,891 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-01-09 22:36:33,894 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 54 treesize of output 46 [2025-01-09 22:36:33,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:33,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2025-01-09 22:36:33,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 22:36:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2025-01-09 22:36:33,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2025-01-09 22:36:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:34,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523569282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:34,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:34,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2025-01-09 22:36:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636085601] [2025-01-09 22:36:34,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:36:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:34,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:36:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1244, Unknown=9, NotChecked=222, Total=1640 [2025-01-09 22:36:34,129 INFO L87 Difference]: Start difference. First operand 285 states and 331 transitions. Second operand has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:35,642 INFO L93 Difference]: Finished difference Result 447 states and 512 transitions. [2025-01-09 22:36:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 22:36:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:36:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:35,644 INFO L225 Difference]: With dead ends: 447 [2025-01-09 22:36:35,644 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 22:36:35,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1107, Invalid=6036, Unknown=9, NotChecked=504, Total=7656 [2025-01-09 22:36:35,646 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 947 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1177 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:35,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1599 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1920 Invalid, 0 Unknown, 1177 Unchecked, 0.7s Time] [2025-01-09 22:36:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 22:36:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 308. [2025-01-09 22:36:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 279 states have (on average 1.2795698924731183) internal successors, (357), 306 states have internal predecessors, (357), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 362 transitions. [2025-01-09 22:36:35,651 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 362 transitions. Word has length 44 [2025-01-09 22:36:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:35,651 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 362 transitions. [2025-01-09 22:36:35,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2025-01-09 22:36:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:36:35,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:35,652 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:35,658 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:36:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:35,853 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:35,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2089858878, now seen corresponding path program 1 times [2025-01-09 22:36:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:35,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974614827] [2025-01-09 22:36:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:35,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:36:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:36:35,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:35,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974614827] [2025-01-09 22:36:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974614827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059767270] [2025-01-09 22:36:36,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:36,362 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:36:36,363 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:36:36,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:36:36,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:36:36,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:36,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 22:36:36,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:36,478 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:36:36,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:36:36,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:36:36,532 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:36:36,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:36,596 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:36,597 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-01-09 22:36:36,601 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 24 treesize of output 11 [2025-01-09 22:36:36,663 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:36:36,663 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 1 case distinctions, treesize of input 23 treesize of output 20 [2025-01-09 22:36:36,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:36:36,680 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:36,681 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 1 case distinctions, treesize of input 24 treesize of output 17 [2025-01-09 22:36:36,716 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:36,717 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-09 22:36:36,719 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 24 treesize of output 11 [2025-01-09 22:36:36,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:36:36,862 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 27 treesize of output 15 [2025-01-09 22:36:36,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:36:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:36,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:36,972 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 69 treesize of output 49 [2025-01-09 22:36:37,282 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< .cse0 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1351 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0))))))) (or (forall ((v_ArrVal_1346 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (or (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_1350) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)))) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1351 (Array Int Int))) (or (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0))) (< (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2025-01-09 22:36:37,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1346))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1351 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1))) (< (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1346))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1351 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0) (< .cse2 (+ (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1)))) (< .cse2 0))))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_106|) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1347))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse4 .cse5 v_ArrVal_1350) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) .cse5))) (< |v_ULTIMATE.start_main_~x~0#1.offset_106| 0))) (forall ((v_ArrVal_1346 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1346) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2025-01-09 22:36:37,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,360 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2025-01-09 22:36:37,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 408 treesize of output 343 [2025-01-09 22:36:37,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 271 [2025-01-09 22:36:37,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 247 [2025-01-09 22:36:37,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,538 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:36:37,540 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 30 treesize of output 22 [2025-01-09 22:36:37,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:36:37,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 22:36:37,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:37,561 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-01-09 22:36:37,563 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:37,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-01-09 22:36:37,567 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:36:37,590 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2025-01-09 22:36:37,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2025-01-09 22:36:37,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:36:37,605 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:36:37,606 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2025-01-09 22:36:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059767270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:36:37,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:36:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2025-01-09 22:36:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127371228] [2025-01-09 22:36:37,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:36:37,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 22:36:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:36:37,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 22:36:37,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1274, Unknown=3, NotChecked=146, Total=1560 [2025-01-09 22:36:37,777 INFO L87 Difference]: Start difference. First operand 308 states and 362 transitions. Second operand has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 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:36:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:36:39,043 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2025-01-09 22:36:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:36:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 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 45 [2025-01-09 22:36:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:36:39,045 INFO L225 Difference]: With dead ends: 362 [2025-01-09 22:36:39,045 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 22:36:39,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=2528, Unknown=3, NotChecked=210, Total=3080 [2025-01-09 22:36:39,046 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 831 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:36:39,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1745 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1900 Invalid, 0 Unknown, 575 Unchecked, 0.8s Time] [2025-01-09 22:36:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 22:36:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 308. [2025-01-09 22:36:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 306 states have internal predecessors, (356), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:36:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2025-01-09 22:36:39,049 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 45 [2025-01-09 22:36:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:36:39,049 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2025-01-09 22:36:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 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:36:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2025-01-09 22:36:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:36:39,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:36:39,050 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:36:39,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:36:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:39,250 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:36:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:36:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 934847769, now seen corresponding path program 1 times [2025-01-09 22:36:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:36:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-01-09 22:36:39,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:36:39,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:36:39,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:36:39,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:36:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-01-09 22:36:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096034626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:36:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065848061] [2025-01-09 22:36:39,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:36:39,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:36:39,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:36:39,650 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:36:39,651 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:36:39,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:36:39,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:36:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:36:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:36:39,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:36:39,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:36:39,772 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:36:39,850 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:36:39,851 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:36:39,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:36:39,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:39,961 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:36:40,037 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:36:40,038 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 1 case distinctions, treesize of input 33 treesize of output 24 [2025-01-09 22:36:40,073 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:36:40,073 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:36:40,235 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-01-09 22:36:40,235 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 4 case distinctions, treesize of input 28 treesize of output 36 [2025-01-09 22:36:40,268 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 34 treesize of output 25 [2025-01-09 22:36:40,279 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 34 treesize of output 25 [2025-01-09 22:36:40,291 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 34 treesize of output 25 [2025-01-09 22:36:40,307 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 25 treesize of output 13 [2025-01-09 22:36:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:36:40,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:36:40,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:40,911 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 37 [2025-01-09 22:36:40,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:40,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1254 treesize of output 1117 [2025-01-09 22:36:40,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2025-01-09 22:36:40,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:36:40,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 182 [2025-01-09 22:36:40,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2025-01-09 22:37:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065848061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:21,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2025-01-09 22:37:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666067608] [2025-01-09 22:37:21,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:21,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:37:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:37:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1487, Unknown=33, NotChecked=0, Total=1722 [2025-01-09 22:37:21,799 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:23,730 INFO L93 Difference]: Finished difference Result 378 states and 434 transitions. [2025-01-09 22:37:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:37:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 22:37:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:23,732 INFO L225 Difference]: With dead ends: 378 [2025-01-09 22:37:23,732 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 22:37:23,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=408, Invalid=2315, Unknown=33, NotChecked=0, Total=2756 [2025-01-09 22:37:23,732 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 727 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1355 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 22:37:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 22:37:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 317. [2025-01-09 22:37:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.2743055555555556) internal successors, (367), 315 states have internal predecessors, (367), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 372 transitions. [2025-01-09 22:37:23,736 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 372 transitions. Word has length 46 [2025-01-09 22:37:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 372 transitions. [2025-01-09 22:37:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 372 transitions. [2025-01-09 22:37:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:37:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,737 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:23,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:37:23,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:23,937 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:37:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 934847770, now seen corresponding path program 1 times [2025-01-09 22:37:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397917414] [2025-01-09 22:37:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:37:23,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:37:23,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397917414] [2025-01-09 22:37:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397917414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892334735] [2025-01-09 22:37:24,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:24,637 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:37:24,639 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:37:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:37:24,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:37:24,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:24,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:37:24,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:24,770 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:37:24,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:24,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:37:24,859 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:37:24,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:24,964 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:24,964 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-01-09 22:37:24,969 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 24 treesize of output 11 [2025-01-09 22:37:25,013 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 16 treesize of output 8 [2025-01-09 22:37:25,054 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 16 treesize of output 11 [2025-01-09 22:37:25,067 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 16 treesize of output 11 [2025-01-09 22:37:25,247 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-01-09 22:37:25,247 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 20 treesize of output 22 [2025-01-09 22:37:25,252 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 18 treesize of output 13 [2025-01-09 22:37:25,280 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 26 treesize of output 19 [2025-01-09 22:37:25,285 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 16 treesize of output 11 [2025-01-09 22:37:25,290 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 26 treesize of output 19 [2025-01-09 22:37:25,297 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 16 treesize of output 11 [2025-01-09 22:37:25,304 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 26 treesize of output 19 [2025-01-09 22:37:25,315 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 16 treesize of output 11 [2025-01-09 22:37:25,344 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:37:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:25,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:25,400 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4))) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2025-01-09 22:37:25,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:25,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2025-01-09 22:37:25,657 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 105 treesize of output 93 [2025-01-09 22:37:25,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2025-01-09 22:37:25,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2025-01-09 22:37:25,752 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2025-01-09 22:37:25,752 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 19 treesize of output 19 [2025-01-09 22:37:26,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_116| Int) (v_ArrVal_1633 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_116| 0) (= |c_ULTIMATE.start_main_~head~0#1.base| v_prenex_1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_116|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1633) v_prenex_1 v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_116|) 5)))) is different from false [2025-01-09 22:37:26,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:26,256 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2025-01-09 22:37:26,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:26,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2025-01-09 22:37:26,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2025-01-09 22:37:26,268 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:26,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:26,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2025-01-09 22:37:26,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2025-01-09 22:37:26,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2025-01-09 22:37:26,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 22:37:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892334735] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:26,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 46 [2025-01-09 22:37:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32511122] [2025-01-09 22:37:26,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 22:37:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:26,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 22:37:26,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1786, Unknown=23, NotChecked=174, Total=2162 [2025-01-09 22:37:26,578 INFO L87 Difference]: Start difference. First operand 317 states and 372 transitions. Second operand has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:28,640 INFO L93 Difference]: Finished difference Result 377 states and 433 transitions. [2025-01-09 22:37:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:37:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 22:37:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:28,642 INFO L225 Difference]: With dead ends: 377 [2025-01-09 22:37:28,642 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 22:37:28,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=640, Invalid=3901, Unknown=23, NotChecked=266, Total=4830 [2025-01-09 22:37:28,643 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 915 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 126 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:28,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1539 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2348 Invalid, 4 Unknown, 553 Unchecked, 1.2s Time] [2025-01-09 22:37:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 22:37:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 317. [2025-01-09 22:37:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.2708333333333333) internal successors, (366), 315 states have internal predecessors, (366), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 371 transitions. [2025-01-09 22:37:28,651 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 371 transitions. Word has length 46 [2025-01-09 22:37:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 371 transitions. [2025-01-09 22:37:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 371 transitions. [2025-01-09 22:37:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:37:28,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:28,652 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-09 22:37:28,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:37:28,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:37:28,853 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:37:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1685998060, now seen corresponding path program 1 times [2025-01-09 22:37:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:28,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-01-09 22:37:28,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:28,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:37:28,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:37:28,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:37:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:28,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-01-09 22:37:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802384992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:37:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247952993] [2025-01-09 22:37:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:28,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:28,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:28,885 INFO L87 Difference]: Start difference. First operand 317 states and 371 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:28,897 INFO L93 Difference]: Finished difference Result 341 states and 394 transitions. [2025-01-09 22:37:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:28,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 22:37:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:28,899 INFO L225 Difference]: With dead ends: 341 [2025-01-09 22:37:28,899 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 22:37:28,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:28,899 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:28,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:37:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 22:37:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 317. [2025-01-09 22:37:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.2604166666666667) internal successors, (363), 315 states have internal predecessors, (363), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 368 transitions. [2025-01-09 22:37:28,904 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 368 transitions. Word has length 47 [2025-01-09 22:37:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 368 transitions. [2025-01-09 22:37:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 368 transitions. [2025-01-09 22:37:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:37:28,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:28,904 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:37:28,905 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2025-01-09 22:37:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1848389300, now seen corresponding path program 2 times [2025-01-09 22:37:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611690521] [2025-01-09 22:37:28,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:37:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:28,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:37:28,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:37:28,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:37:28,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611690521] [2025-01-09 22:37:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611690521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623302430] [2025-01-09 22:37:29,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:37:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:29,384 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:37:29,385 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:37:29,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:37:29,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:37:29,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:37:29,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:29,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:37:29,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:29,525 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:37:29,587 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:29,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:37:29,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:29,686 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:29,686 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:37:29,745 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:29,745 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 1 case distinctions, treesize of input 24 treesize of output 17 [2025-01-09 22:37:29,792 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:29,792 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 1 case distinctions, treesize of input 24 treesize of output 17 [2025-01-09 22:37:29,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:29,816 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:37:29,817 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:37:29,851 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:37:29,851 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 1 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 22:37:29,923 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:37:29,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 48 [2025-01-09 22:37:30,020 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-09 22:37:30,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2025-01-09 22:37:30,058 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:37:30,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2025-01-09 22:37:30,198 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:37:30,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-01-09 22:37:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:30,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:30,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))) is different from false [2025-01-09 22:37:30,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))) is different from false [2025-01-09 22:37:30,460 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2025-01-09 22:37:30,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2025-01-09 22:37:30,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2025-01-09 22:37:30,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:30,560 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2025-01-09 22:37:30,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~x~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (not (= 0 (select |c_#valid| .cse0))) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_1863))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2025-01-09 22:37:30,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:30,902 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2025-01-09 22:37:30,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:30,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3978 treesize of output 3549 [2025-01-09 22:37:30,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:30,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1395 treesize of output 1187 [2025-01-09 22:37:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1342 treesize of output 1278 [2025-01-09 22:37:31,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1286 treesize of output 1046 [2025-01-09 22:37:31,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:31,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1032 treesize of output 956 [2025-01-09 22:37:31,084 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2025-01-09 22:37:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2025-01-09 22:37:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-01-09 22:37:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623302430] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:32,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 54 [2025-01-09 22:37:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855121016] [2025-01-09 22:37:32,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:32,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 22:37:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:32,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 22:37:32,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2335, Unknown=14, NotChecked=404, Total=2970 [2025-01-09 22:37:32,164 INFO L87 Difference]: Start difference. First operand 317 states and 368 transitions. Second operand has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)