./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0219.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/memsafety/test-0219.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 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:18:54,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:18:54,901 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:18:54,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:18:54,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:18:54,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:18:54,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:18:54,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:18:54,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:18:54,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:18:54,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:18:54,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:18:54,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:18:54,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:18:54,929 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:18:54,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:18:54,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:18:54,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:18:54,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:54,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:18:54,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:54,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:18:54,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:18:54,932 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 -> 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 [2025-01-09 22:18:55,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:18:55,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:18:55,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:18:55,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:18:55,157 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:18:55,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0219.i [2025-01-09 22:18:56,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f331054/f4d3b817d41a45648c37e7733ce66e78/FLAG7fa752133 [2025-01-09 22:18:56,591 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:18:56,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0219.i [2025-01-09 22:18:56,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f331054/f4d3b817d41a45648c37e7733ce66e78/FLAG7fa752133 [2025-01-09 22:18:56,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f331054/f4d3b817d41a45648c37e7733ce66e78 [2025-01-09 22:18:56,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:18:56,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:18:56,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:18:56,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:18:56,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:18:56,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0892c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56, skipping insertion in model container [2025-01-09 22:18:56,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:18:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:18:56,841 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:18:56,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:18:56,900 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:18:56,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56 WrapperNode [2025-01-09 22:18:56,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:18:56,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:18:56,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:18:56,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:18:56,905 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:18:56" (1/1) ... [2025-01-09 22:18:56,911 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:18:56" (1/1) ... [2025-01-09 22:18:56,928 INFO L138 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2025-01-09 22:18:56,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:18:56,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:18:56,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:18:56,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:18:56,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,949 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-01-09 22:18:56,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:18:56,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:18:56,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:18:56,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:18:56,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:56,991 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:18:56,995 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:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2025-01-09 22:18:57,008 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2025-01-09 22:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:18:57,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:18:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:18:57,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:18:57,094 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:18:57,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:18:57,320 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-09 22:18:57,320 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:18:57,328 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:18:57,328 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 22:18:57,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:18:57 BoogieIcfgContainer [2025-01-09 22:18:57,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:18:57,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:18:57,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:18:57,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:18:57,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:18:56" (1/3) ... [2025-01-09 22:18:57,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d93d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:18:57, skipping insertion in model container [2025-01-09 22:18:57,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (2/3) ... [2025-01-09 22:18:57,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d93d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:18:57, skipping insertion in model container [2025-01-09 22:18:57,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:18:57" (3/3) ... [2025-01-09 22:18:57,337 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0219.i [2025-01-09 22:18:57,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:18:57,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0219.i that has 2 procedures, 108 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2025-01-09 22:18:57,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:18:57,390 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;@73ea1104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:18:57,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 22:18:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:18:57,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:18:57,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1358984, now seen corresponding path program 1 times [2025-01-09 22:18:57,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099510464] [2025-01-09 22:18:57,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:18:57,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:18:57,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,497 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:18:57,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099510464] [2025-01-09 22:18:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099510464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846259897] [2025-01-09 22:18:57,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:18:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:18:57,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:18:57,518 INFO L87 Difference]: Start difference. First operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,530 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-01-09 22:18:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:18:57,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:18:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,535 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:18:57,535 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:18:57,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:18:57,538 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:18:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:18:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 22:18:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2025-01-09 22:18:57,563 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 4 [2025-01-09 22:18:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2025-01-09 22:18:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2025-01-09 22:18:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:18:57,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:18:57,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:57,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849244, now seen corresponding path program 1 times [2025-01-09 22:18:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-01-09 22:18:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:18:57,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:18:57,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,701 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:18:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-01-09 22:18:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663057042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275082785] [2025-01-09 22:18:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:18:57,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:18:57,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:18:57,705 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,790 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-01-09 22:18:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:18:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:18:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,791 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:18:57,791 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:18:57,791 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:18:57,791 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:18:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 22:18:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2025-01-09 22:18:57,796 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 6 [2025-01-09 22:18:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2025-01-09 22:18:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2025-01-09 22:18:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:18:57,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:18:57,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1764620934, now seen corresponding path program 1 times [2025-01-09 22:18:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-01-09 22:18:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:18:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:18:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 22:18:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434701745] [2025-01-09 22:18:57,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:57,830 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:18:57,831 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:18:57,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:18:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:18:57,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:18:57,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:57,942 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:18:57,958 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:18:57,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:18:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-01-09 22:18:57,959 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 22:18:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434701745] [2025-01-09 22:18:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434701745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:18:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886602747] [2025-01-09 22:18:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:57,960 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,030 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-01-09 22:18:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:18:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:18:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,031 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:18:58,031 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:18:58,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:18:58,032 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:18:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:18:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 100 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2025-01-09 22:18:58,039 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 7 [2025-01-09 22:18:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,039 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2025-01-09 22:18:58,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2025-01-09 22:18:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:18:58,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,046 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:18:58,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:58,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash 705483664, now seen corresponding path program 1 times [2025-01-09 22:18:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064476788] [2025-01-09 22:18:58,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:18:58,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:18:58,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:18:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064476788] [2025-01-09 22:18:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064476788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:58,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:18:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089047982] [2025-01-09 22:18:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:58,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:18:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:58,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:18:58,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:18:58,477 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:18:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,626 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-01-09 22:18:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 22:18:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,627 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:18:58,628 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:18:58,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:18:58,629 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 377 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:18:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:18:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-01-09 22:18:58,638 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 26 [2025-01-09 22:18:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-01-09 22:18:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:18:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-01-09 22:18:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:18:58,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:18:58,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 705483665, now seen corresponding path program 1 times [2025-01-09 22:18:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-01-09 22:18:58,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:18:58,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:18:58,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 22:18:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311441880] [2025-01-09 22:18:58,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:58,671 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:18:58,672 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:18:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:18:58,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:18:58,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 22:18:58,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:58,785 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:18:58,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-09 22:18:59,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:18:59,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:18:59,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:18:59,044 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:18:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:18:59,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:18:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-01-09 22:18:59,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 22:18:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311441880] [2025-01-09 22:18:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311441880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:18:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467633477] [2025-01-09 22:18:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:18:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:59,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:18:59,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:18:59,062 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:18:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:59,317 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-01-09 22:18:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:18:59,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 22:18:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:59,318 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:18:59,318 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:18:59,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:18:59,318 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 25 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:59,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 280 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:18:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:18:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:18:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 94 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-01-09 22:18:59,325 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 26 [2025-01-09 22:18:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:59,325 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-01-09 22:18:59,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:18:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-01-09 22:18:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:18:59,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:59,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:59,334 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:18:59,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:59,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:18:59,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -379640877, now seen corresponding path program 1 times [2025-01-09 22:18:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490095563] [2025-01-09 22:18:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:59,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:18:59,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:18:59,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490095563] [2025-01-09 22:18:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490095563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:18:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124585032] [2025-01-09 22:18:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:18:59,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:59,800 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:18:59,802 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:18:59,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:18:59,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:18:59,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:18:59,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:18:59,901 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:18:59,941 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2025-01-09 22:18:59,994 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:18:59,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:19:00,010 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:19:00,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:19:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:19:00,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:19:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124585032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:00,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:19:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2025-01-09 22:19:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276749282] [2025-01-09 22:19:00,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:19:00,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:19:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:00,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:19:00,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:19:00,107 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:19:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:00,379 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-01-09 22:19:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:19:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-09 22:19:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:00,380 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:19:00,381 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:19:00,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:19:00,381 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:00,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 434 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2025-01-09 22:19:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:19:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-01-09 22:19:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:19:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2025-01-09 22:19:00,388 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 30 [2025-01-09 22:19:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:00,388 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2025-01-09 22:19:00,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:19:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2025-01-09 22:19:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:19:00,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:00,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:00,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:19:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:00,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:19:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -379640876, now seen corresponding path program 1 times [2025-01-09 22:19:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-01-09 22:19:00,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:00,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:19:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:19:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:19:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-01-09 22:19:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036216619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:19:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313741991] [2025-01-09 22:19:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:00,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:19:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:00,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:19:00,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:19:00,976 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:19:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,217 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2025-01-09 22:19:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:19:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-09 22:19:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,218 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:19:01,218 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:19:01,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:19:01,219 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:19:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:19:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 95 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:19:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-01-09 22:19:01,228 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 30 [2025-01-09 22:19:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,229 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-01-09 22:19:01,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:19:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-01-09 22:19:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:19:01,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,229 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:19:01,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:19:01,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:19:01,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -173980622, now seen corresponding path program 1 times [2025-01-09 22:19:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-01-09 22:19:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:19:01,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:19:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:19:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-01-09 22:19:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863702791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515517519] [2025-01-09 22:19:01,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:01,645 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:19:01,647 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:19:01,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:19:01,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:19:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:19:01,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:01,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:19:01,777 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:19:14,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:19:14,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:19:14,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:19:14,358 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:19:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:19:14,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:19:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:19:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515517519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:19:23,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:19:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-01-09 22:19:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643185630] [2025-01-09 22:19:23,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:19:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:19:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:23,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:19:23,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=596, Unknown=5, NotChecked=0, Total=702 [2025-01-09 22:19:23,622 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:19:28,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 22:19:45,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 22:20:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:18,310 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-01-09 22:20:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:20:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2025-01-09 22:20:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:18,311 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:20:18,311 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:20:18,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=171, Invalid=936, Unknown=15, NotChecked=0, Total=1122 [2025-01-09 22:20:18,312 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:18,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 691 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 937 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-01-09 22:20:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:20:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-01-09 22:20:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 98 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2025-01-09 22:20:18,320 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 31 [2025-01-09 22:20:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:18,320 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2025-01-09 22:20:18,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:20:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2025-01-09 22:20:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:20:18,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:18,322 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:18,328 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:20:18,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 22:20:18,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:18,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -116176044, now seen corresponding path program 2 times [2025-01-09 22:20:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657289590] [2025-01-09 22:20:18,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:20:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:18,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 22:20:18,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:20:18,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:20:18,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 22:20:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895402622] [2025-01-09 22:20:18,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:20:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:20:18,554 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:20:18,556 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:20:18,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 22:20:18,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:20:18,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:20:18,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:18,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 22:20:18,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:20:18,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-09 22:20:18,679 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:20:18,911 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:20:18,911 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:20:18,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:20:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:20:18,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:20:19,002 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:20:19,003 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:20:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:20:19,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:20:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657289590] [2025-01-09 22:20:19,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 22:20:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895402622] [2025-01-09 22:20:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895402622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:19,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:20:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 22:20:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893535972] [2025-01-09 22:20:19,253 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 22:20:19,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:20:19,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:19,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:20:19,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:20:19,254 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:19,832 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-01-09 22:20:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:20:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-01-09 22:20:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:19,834 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:20:19,834 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:20:19,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:20:19,834 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 413 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:20:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:20:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:20:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:20:19,837 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 34 [2025-01-09 22:20:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:19,838 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:20:19,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:20:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:20:19,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:19,838 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:19,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:20:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:20,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1755085535, now seen corresponding path program 1 times [2025-01-09 22:20:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-01-09 22:20:20,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:20,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:20:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:20:20,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:20,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:20:20,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973493499] [2025-01-09 22:20:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973493499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:20:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:20:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:20:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512785147] [2025-01-09 22:20:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:20:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:20:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:20,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:20:20,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:20:20,454 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:20,683 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2025-01-09 22:20:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:20:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-01-09 22:20:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:20,684 INFO L225 Difference]: With dead ends: 122 [2025-01-09 22:20:20,684 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 22:20:20,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:20:20,685 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 101 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:20,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 378 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:20:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 22:20:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2025-01-09 22:20:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.626865671641791) internal successors, (109), 97 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-01-09 22:20:20,689 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 40 [2025-01-09 22:20:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-01-09 22:20:20,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-01-09 22:20:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:20:20,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:20,691 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:20,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:20:20,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1755085536, now seen corresponding path program 1 times [2025-01-09 22:20:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377133662] [2025-01-09 22:20:20,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:20,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:20:20,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:20:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:20:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377133662] [2025-01-09 22:20:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377133662] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089665933] [2025-01-09 22:20:21,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:21,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:21,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:20:21,297 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:20:21,298 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:20:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:20:21,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:20:21,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:21,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:21,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:20:21,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:20:21,465 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2025-01-09 22:20:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:20:21,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:20:21,519 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:20:21,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:20:21,549 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:20:21,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:20:21,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:20:21,638 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:20:21,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:20:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2025-01-09 22:20:21,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:20:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089665933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:21,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:20:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 21 [2025-01-09 22:20:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722568983] [2025-01-09 22:20:21,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:20:21,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:20:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:21,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:20:21,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=454, Unknown=2, NotChecked=90, Total=650 [2025-01-09 22:20:21,919 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:20:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:22,362 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-01-09 22:20:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:20:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-01-09 22:20:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:22,363 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:20:22,363 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:20:22,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=752, Unknown=2, NotChecked=118, Total=1056 [2025-01-09 22:20:22,364 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 100 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:22,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 428 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 424 Invalid, 0 Unknown, 231 Unchecked, 0.3s Time] [2025-01-09 22:20:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:20:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2025-01-09 22:20:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-01-09 22:20:22,366 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 40 [2025-01-09 22:20:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:22,366 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-01-09 22:20:22,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:20:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-01-09 22:20:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:20:22,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:22,367 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:22,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:20:22,567 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,SelfDestructingSolverStorable10 [2025-01-09 22:20:22,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:22,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 26593434, now seen corresponding path program 1 times [2025-01-09 22:20:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-01-09 22:20:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:22,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:20:22,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:20:22,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:20:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-01-09 22:20:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733631777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:20:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:20:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:20:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819233633] [2025-01-09 22:20:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:20:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:20:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:20:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:20:22,722 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:20:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:22,886 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2025-01-09 22:20:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:20:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2025-01-09 22:20:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:22,887 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:20:22,887 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:20:22,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:20:22,888 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:22,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 266 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:20:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:20:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2025-01-09 22:20:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-01-09 22:20:22,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 47 [2025-01-09 22:20:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:22,892 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-01-09 22:20:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:20:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-01-09 22:20:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:20:22,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:22,893 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:22,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:20:22,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 26593435, now seen corresponding path program 1 times [2025-01-09 22:20:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352756565] [2025-01-09 22:20:22,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:22,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:20:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:20:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:20:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352756565] [2025-01-09 22:20:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352756565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136530186] [2025-01-09 22:20:23,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:20:23,188 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:20:23,190 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:20:23,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:20:23,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:20:23,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:23,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:20:23,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:20:23,736 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:20:23,746 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:20:23,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:23,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 22:20:23,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:23,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:20:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:20:23,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:20:23,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-01-09 22:20:23,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 90 treesize of output 82 [2025-01-09 22:20:23,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:20:23,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:20:24,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:20:24,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2025-01-09 22:20:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:20:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136530186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:20:24,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:20:24,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2025-01-09 22:20:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721965075] [2025-01-09 22:20:24,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:20:24,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:20:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:24,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:20:24,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:20:24,292 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 32 states, 28 states have (on average 4.035714285714286) internal successors, (113), 29 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:20:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:24,900 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-01-09 22:20:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:20:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 4.035714285714286) internal successors, (113), 29 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2025-01-09 22:20:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:24,902 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:20:24,902 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:20:24,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:20:24,902 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 354 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:24,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 650 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:20:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:20:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2025-01-09 22:20:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:20:24,907 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 47 [2025-01-09 22:20:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:20:24,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 4.035714285714286) internal successors, (113), 29 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:20:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:20:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:20:24,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:24,909 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:24,915 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:20:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:25,109 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:25,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1971083347, now seen corresponding path program 1 times [2025-01-09 22:20:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343292466] [2025-01-09 22:20:25,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:25,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:20:25,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:20:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:20:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343292466] [2025-01-09 22:20:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343292466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:20:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:20:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:20:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32463899] [2025-01-09 22:20:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:20:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:20:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:25,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:20:25,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:20:25,188 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:20:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:25,268 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2025-01-09 22:20:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:20:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-01-09 22:20:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:25,269 INFO L225 Difference]: With dead ends: 111 [2025-01-09 22:20:25,269 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 22:20:25,269 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:20:25,269 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 18 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:25,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:20:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 22:20:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-01-09 22:20:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-01-09 22:20:25,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 50 [2025-01-09 22:20:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-01-09 22:20:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:20:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-01-09 22:20:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:20:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:25,273 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:25,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:20:25,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:25,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1971083348, now seen corresponding path program 1 times [2025-01-09 22:20:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-01-09 22:20:25,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:25,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:20:25,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:20:25,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:25,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:20:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-01-09 22:20:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697700232] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003910716] [2025-01-09 22:20:25,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:20:25,737 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:20:25,739 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:20:25,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:20:25,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:20:25,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:25,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:25,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 22:20:25,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:20:26,212 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:20:26,216 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:20:26,377 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:26,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 22:20:26,380 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:26,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:20:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:20:26,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:20:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003910716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:20:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:20:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2025-01-09 22:20:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889530300] [2025-01-09 22:20:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:20:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:20:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:20:26,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:20:26,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:20:26,387 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:20:26,670 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2025-01-09 22:20:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:20:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-01-09 22:20:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:20:26,671 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:20:26,671 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:20:26,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:20:26,671 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 99 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:20:26,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 325 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:20:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:20:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2025-01-09 22:20:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:20:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:20:26,674 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 50 [2025-01-09 22:20:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:20:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:20:26,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:20:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:20:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:20:26,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:20:26,675 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:20:26,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:20:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:20:26,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:20:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:20:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 130521527, now seen corresponding path program 1 times [2025-01-09 22:20:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:20:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48912489] [2025-01-09 22:20:26,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:20:26,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:20:26,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:20:26,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:26,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:20:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:20:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48912489] [2025-01-09 22:20:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48912489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:20:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836008819] [2025-01-09 22:20:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:20:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:20:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:20:27,457 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:20:27,457 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:20:27,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:20:27,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:20:27,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:20:27,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:20:27,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 22:20:27,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:20:27,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:20:28,020 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 27 treesize of output 15 [2025-01-09 22:20:28,042 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:20:28,046 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:20:28,261 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 22:20:28,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:20:28,264 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 37 treesize of output 21 [2025-01-09 22:20:28,292 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:20:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:20:28,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:20:28,452 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 68 treesize of output 64 [2025-01-09 22:20:28,454 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 133 treesize of output 121