./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext.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/list-ext-properties/list-ext.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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:16:27,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:16:27,211 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:16:27,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:16:27,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:16:27,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:16:27,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:16:27,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:16:27,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:16:27,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:16:27,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:16:27,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:16:27,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:16:27,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:16:27,254 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:16:27,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:16:27,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:16:27,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:16:27,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:16:27,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:16:27,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:16:27,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:16:27,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:27,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:27,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:27,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:16:27,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:16:27,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:16:27,259 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 -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2025-01-09 22:16:27,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:16:27,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:16:27,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:16:27,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:16:27,592 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:16:27,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext.i [2025-01-09 22:16:28,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b20b1b85/a1e8533b91b745458fec7e04117f177c/FLAG11adbb9b8 [2025-01-09 22:16:29,277 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:16:29,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2025-01-09 22:16:29,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b20b1b85/a1e8533b91b745458fec7e04117f177c/FLAG11adbb9b8 [2025-01-09 22:16:29,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b20b1b85/a1e8533b91b745458fec7e04117f177c [2025-01-09 22:16:29,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:16:29,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:16:29,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:29,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:16:29,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:16:29,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29, skipping insertion in model container [2025-01-09 22:16:29,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:16:29,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:29,645 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:16:29,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:29,720 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:16:29,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29 WrapperNode [2025-01-09 22:16:29,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:29,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:29,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:16:29,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:16:29,728 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:16:29" (1/1) ... [2025-01-09 22:16:29,744 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:16:29" (1/1) ... [2025-01-09 22:16:29,765 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2025-01-09 22:16:29,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:29,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:16:29,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:16:29,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:16:29,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,796 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-01-09 22:16:29,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:16:29,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:16:29,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:16:29,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:16:29,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (1/1) ... [2025-01-09 22:16:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:29,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:29,846 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:16:29,851 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:16:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 22:16:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 22:16:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:16:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:16:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:16:29,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:16:29,977 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:16:29,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:16:30,004 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 22:16:30,338 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-01-09 22:16:30,338 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:16:30,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:16:30,352 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 22:16:30,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:30 BoogieIcfgContainer [2025-01-09 22:16:30,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:16:30,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:16:30,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:16:30,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:16:30,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:16:29" (1/3) ... [2025-01-09 22:16:30,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa439a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:30, skipping insertion in model container [2025-01-09 22:16:30,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:29" (2/3) ... [2025-01-09 22:16:30,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fa439a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:30, skipping insertion in model container [2025-01-09 22:16:30,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:30" (3/3) ... [2025-01-09 22:16:30,363 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext.i [2025-01-09 22:16:30,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:16:30,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext.i that has 2 procedures, 101 locations, 1 initial locations, 5 loop locations, and 38 error locations. [2025-01-09 22:16:30,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:16:30,429 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;@31a9589f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:16:30,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 22:16:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:16:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:16:30,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:30,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:30,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:30,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2098270962, now seen corresponding path program 1 times [2025-01-09 22:16:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838307690] [2025-01-09 22:16:30,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:30,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:16:30,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:16:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:30,582 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:16:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838307690] [2025-01-09 22:16:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838307690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:16:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108068551] [2025-01-09 22:16:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:30,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:16:30,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:30,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:16:30,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:16:30,613 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:30,632 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-01-09 22:16:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:16:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-01-09 22:16:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:30,637 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:16:30,637 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:16:30,639 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:16:30,641 INFO L435 NwaCegarLoop]: 108 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, 108 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:16:30,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:16:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:16:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 22:16:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 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:16:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-01-09 22:16:30,670 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 7 [2025-01-09 22:16:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-01-09 22:16:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-01-09 22:16:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:16:30,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:30,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:30,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:16:30,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:30,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199990, now seen corresponding path program 1 times [2025-01-09 22:16:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:30,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-01-09 22:16:30,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:30,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:16:30,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:16:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:30,795 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:16:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:30,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-01-09 22:16:30,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662413117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:30,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:30,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658980112] [2025-01-09 22:16:30,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:30,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:30,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:30,797 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:31,014 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-01-09 22:16:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-09 22:16:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:31,015 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:16:31,015 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:16:31,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:16:31,016 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:31,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 64 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:16:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 22:16:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 94 states have internal predecessors, (111), 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:16:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-01-09 22:16:31,027 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 9 [2025-01-09 22:16:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:31,028 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-01-09 22:16:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-01-09 22:16:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:16:31,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:31,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:16:31,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199991, now seen corresponding path program 1 times [2025-01-09 22:16:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-01-09 22:16:31,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:31,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:16:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:16:31,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:31,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:31,200 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:16:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:31,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-01-09 22:16:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006242003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:31,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036551892] [2025-01-09 22:16:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:31,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:31,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:31,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:31,204 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:31,389 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2025-01-09 22:16:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-09 22:16:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:31,391 INFO L225 Difference]: With dead ends: 117 [2025-01-09 22:16:31,391 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 22:16:31,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:16:31,392 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:31,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 93 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 22:16:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 22:16:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 116 states have internal predecessors, (131), 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:16:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2025-01-09 22:16:31,403 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 9 [2025-01-09 22:16:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:31,403 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2025-01-09 22:16:31,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2025-01-09 22:16:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:31,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:31,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:16:31,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137561, now seen corresponding path program 1 times [2025-01-09 22:16:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049882167] [2025-01-09 22:16:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:31,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:31,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:31,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:31,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049882167] [2025-01-09 22:16:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049882167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241046469] [2025-01-09 22:16:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:31,642 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:31,859 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2025-01-09 22:16:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:31,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:31,861 INFO L225 Difference]: With dead ends: 122 [2025-01-09 22:16:31,861 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 22:16:31,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:31,862 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:31,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 22:16:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 22:16:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 121 states have internal predecessors, (140), 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:16:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2025-01-09 22:16:31,874 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 19 [2025-01-09 22:16:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:31,874 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2025-01-09 22:16:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2025-01-09 22:16:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:31,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:31,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:16:31,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:31,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137560, now seen corresponding path program 1 times [2025-01-09 22:16:31,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:31,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383112206] [2025-01-09 22:16:31,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:31,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:31,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383112206] [2025-01-09 22:16:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383112206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754986895] [2025-01-09 22:16:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:32,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:32,196 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:32,424 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2025-01-09 22:16:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:32,425 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:16:32,425 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:16:32,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:32,427 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:32,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 273 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:16:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2025-01-09 22:16:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 103 states have internal predecessors, (116), 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:16:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2025-01-09 22:16:32,437 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 19 [2025-01-09 22:16:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:32,437 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2025-01-09 22:16:32,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2025-01-09 22:16:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:32,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:16:32,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:32,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 691891406, now seen corresponding path program 1 times [2025-01-09 22:16:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-01-09 22:16:32,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:32,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:32,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610679270] [2025-01-09 22:16:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610679270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8466592] [2025-01-09 22:16:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:32,656 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:16:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:32,840 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2025-01-09 22:16:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:32,842 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:16:32,842 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:16:32,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:16:32,843 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:32,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 270 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:16:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 115. [2025-01-09 22:16:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.423913043478261) internal successors, (131), 114 states have internal predecessors, (131), 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:16:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2025-01-09 22:16:32,849 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 19 [2025-01-09 22:16:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:32,850 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2025-01-09 22:16:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:16:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2025-01-09 22:16:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:32,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:16:32,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -509806655, now seen corresponding path program 1 times [2025-01-09 22:16:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908320506] [2025-01-09 22:16:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908320506] [2025-01-09 22:16:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908320506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157615193] [2025-01-09 22:16:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:32,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:32,984 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,143 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-01-09 22:16:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,144 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:16:33,144 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:16:33,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:33,145 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:16:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 22:16:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 112 states have internal predecessors, (129), 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:16:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2025-01-09 22:16:33,159 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 21 [2025-01-09 22:16:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,159 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2025-01-09 22:16:33,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2025-01-09 22:16:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:33,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:16:33,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -509806654, now seen corresponding path program 1 times [2025-01-09 22:16:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905172119] [2025-01-09 22:16:33,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:33,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:33,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905172119] [2025-01-09 22:16:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905172119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934508129] [2025-01-09 22:16:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:33,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:33,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:33,391 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,569 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2025-01-09 22:16:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:33,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,570 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:16:33,570 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:16:33,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:33,571 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 240 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:16:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2025-01-09 22:16:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 96 states have internal predecessors, (111), 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:16:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-01-09 22:16:33,575 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 21 [2025-01-09 22:16:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-01-09 22:16:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-01-09 22:16:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:33,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:16:33,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1262416469, now seen corresponding path program 1 times [2025-01-09 22:16:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855145856] [2025-01-09 22:16:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855145856] [2025-01-09 22:16:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855145856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239986159] [2025-01-09 22:16:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:33,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:33,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:33,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:33,704 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:16:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,877 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2025-01-09 22:16:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,878 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:16:33,878 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:16:33,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:16:33,879 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 263 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:16:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2025-01-09 22:16:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 98 states have internal predecessors, (113), 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:16:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-01-09 22:16:33,883 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 21 [2025-01-09 22:16:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,883 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-01-09 22:16:33,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:16:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-01-09 22:16:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:16:33,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:16:33,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:33,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 545220426, now seen corresponding path program 1 times [2025-01-09 22:16:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542352128] [2025-01-09 22:16:33,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:33,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:33,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:16:33,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:16:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:33,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:33,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:16:33,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:16:33,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:16:33,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2025-01-09 22:16:33,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2025-01-09 22:16:33,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2025-01-09 22:16:33,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2025-01-09 22:16:33,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2025-01-09 22:16:33,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2025-01-09 22:16:33,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2025-01-09 22:16:33,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2025-01-09 22:16:33,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2025-01-09 22:16:33,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2025-01-09 22:16:33,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2025-01-09 22:16:33,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2025-01-09 22:16:33,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2025-01-09 22:16:33,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:16:33,947 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:16:33,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:16:33 BoogieIcfgContainer [2025-01-09 22:16:33,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:16:33,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:16:33,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:16:33,983 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:16:33,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:30" (3/4) ... [2025-01-09 22:16:33,985 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 22:16:33,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:16:33,988 INFO L158 Benchmark]: Toolchain (without parser) took 4667.21ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.9MB in the beginning and 239.1MB in the end (delta: -133.2MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2025-01-09 22:16:33,988 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:33,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.52ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 87.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:16:33,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.25ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:33,990 INFO L158 Benchmark]: Boogie Preprocessor took 47.73ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:16:33,991 INFO L158 Benchmark]: RCFGBuilder took 536.59ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.4MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:16:33,991 INFO L158 Benchmark]: TraceAbstraction took 3624.60ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.5MB in the beginning and 239.1MB in the end (delta: -177.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:33,991 INFO L158 Benchmark]: Witness Printer took 6.76ms. Allocated memory is still 285.2MB. Free memory was 239.1MB in the beginning and 239.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:33,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.52ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 87.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.25ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.73ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 536.59ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 62.4MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3624.60ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.5MB in the beginning and 239.1MB in the end (delta: -177.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.76ms. Allocated memory is still 285.2MB. Free memory was 239.1MB in the beginning and 239.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={-1:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L538] i < 10 && __VERIFIER_nondet_int() [L538] i < 10 && __VERIFIER_nondet_int() VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] y < 10 && __VERIFIER_nondet_int() [L546] y < 10 && __VERIFIER_nondet_int() VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 [L555] p->n = 0 [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L559] EXPR p->h [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 1730 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1379 IncrementalHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 615 mSDtfsCounter, 1379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 128 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 22:16:34,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-ext-properties/list-ext.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:16:36,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:16:36,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-09 22:16:36,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:16:36,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:16:36,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:16:36,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:16:36,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:16:36,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:16:36,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:16:36,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:16:36,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:16:36,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:16:36,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:16:36,496 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:16:36,498 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:16:36,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:16:36,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:16:36,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:36,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:36,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:36,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:36,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:16:36,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:36,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:36,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:36,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:36,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:16:36,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:16:36,502 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 -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2025-01-09 22:16:36,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:16:36,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:16:36,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:16:36,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:16:36,810 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:16:36,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext.i [2025-01-09 22:16:38,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e110a607/4fa2e02073394e159fa7098a5a0eab18/FLAG5c64b1a42 [2025-01-09 22:16:38,490 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:16:38,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext.i [2025-01-09 22:16:38,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e110a607/4fa2e02073394e159fa7098a5a0eab18/FLAG5c64b1a42 [2025-01-09 22:16:38,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e110a607/4fa2e02073394e159fa7098a5a0eab18 [2025-01-09 22:16:38,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:16:38,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:16:38,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:38,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:16:38,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:16:38,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:38,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd46de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38, skipping insertion in model container [2025-01-09 22:16:38,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:38,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:16:38,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:38,868 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:16:38,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:38,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:16:38,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38 WrapperNode [2025-01-09 22:16:38,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:38,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:38,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:16:38,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:16:38,949 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:16:38" (1/1) ... [2025-01-09 22:16:38,964 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:16:38" (1/1) ... [2025-01-09 22:16:38,992 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2025-01-09 22:16:38,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:38,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:16:38,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:16:38,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:16:39,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,026 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-01-09 22:16:39,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:16:39,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:16:39,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:16:39,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:16:39,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (1/1) ... [2025-01-09 22:16:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:39,097 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:16:39,102 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:16:39,125 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 22:16:39,126 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 22:16:39,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:16:39,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:16:39,226 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:16:39,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:16:39,255 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 22:16:39,731 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-01-09 22:16:39,732 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:16:39,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:16:39,747 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 22:16:39,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:39 BoogieIcfgContainer [2025-01-09 22:16:39,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:16:39,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:16:39,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:16:39,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:16:39,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:16:38" (1/3) ... [2025-01-09 22:16:39,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c318fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:39, skipping insertion in model container [2025-01-09 22:16:39,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:38" (2/3) ... [2025-01-09 22:16:39,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c318fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:39, skipping insertion in model container [2025-01-09 22:16:39,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:39" (3/3) ... [2025-01-09 22:16:39,758 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext.i [2025-01-09 22:16:39,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:16:39,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext.i that has 2 procedures, 101 locations, 1 initial locations, 5 loop locations, and 38 error locations. [2025-01-09 22:16:39,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:16:39,817 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;@4d6f3d4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:16:39,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 22:16:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:16:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:16:39,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:39,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:39,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:39,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2098270962, now seen corresponding path program 1 times [2025-01-09 22:16:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:39,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624675203] [2025-01-09 22:16:39,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:39,862 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:16:39,864 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:16:39,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:16:39,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:16:39,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:39,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:39,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 22:16:39,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:39,963 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:16:39,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:39,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624675203] [2025-01-09 22:16:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624675203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:39,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:16:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584551648] [2025-01-09 22:16:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:16:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:39,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:16:39,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:16:39,989 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:40,001 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-01-09 22:16:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:16:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-01-09 22:16:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:40,006 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:16:40,007 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:16:40,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:16:40,010 INFO L435 NwaCegarLoop]: 108 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, 108 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:16:40,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:16:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:16:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 22:16:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 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:16:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-01-09 22:16:40,041 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 7 [2025-01-09 22:16:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-01-09 22:16:40,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-01-09 22:16:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:16:40,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:40,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:40,050 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:16:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199990, now seen corresponding path program 1 times [2025-01-09 22:16:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91715253] [2025-01-09 22:16:40,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:40,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:40,251 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:16:40,254 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:16:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:16:40,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:16:40,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:40,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:40,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:16:40,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:40,367 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 7 [2025-01-09 22:16:40,430 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:16:40,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:40,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91715253] [2025-01-09 22:16:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91715253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:40,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:40,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847509600] [2025-01-09 22:16:40,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:40,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:40,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:40,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:40,436 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:40,749 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-01-09 22:16:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-09 22:16:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:40,751 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:16:40,751 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:16:40,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:16:40,752 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:40,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 64 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:16:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:16:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 22:16:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 94 states have internal predecessors, (111), 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:16:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-01-09 22:16:40,766 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 9 [2025-01-09 22:16:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:40,766 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-01-09 22:16:40,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-01-09 22:16:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:16:40,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:40,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:40,776 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:16:40,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2066199991, now seen corresponding path program 1 times [2025-01-09 22:16:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858876980] [2025-01-09 22:16:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:40,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:40,975 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:16:40,976 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:16:41,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:16:41,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:16:41,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:41,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:41,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:16:41,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:41,044 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:16:41,133 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:16:41,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:41,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858876980] [2025-01-09 22:16:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858876980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500709641] [2025-01-09 22:16:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:41,134 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:41,401 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2025-01-09 22:16:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-09 22:16:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:41,403 INFO L225 Difference]: With dead ends: 117 [2025-01-09 22:16:41,403 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 22:16:41,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:16:41,404 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:41,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 93 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 22:16:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 22:16:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 116 states have internal predecessors, (131), 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:16:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2025-01-09 22:16:41,412 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 9 [2025-01-09 22:16:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:41,412 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2025-01-09 22:16:41,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:16:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2025-01-09 22:16:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:41,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:41,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:41,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:16:41,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:41,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137561, now seen corresponding path program 1 times [2025-01-09 22:16:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608032405] [2025-01-09 22:16:41,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:41,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:41,617 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:16:41,618 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:16:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:41,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:41,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:41,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:41,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:16:41,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:41,692 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 7 [2025-01-09 22:16:41,720 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:16:41,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:16:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:41,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:41,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608032405] [2025-01-09 22:16:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608032405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105161218] [2025-01-09 22:16:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:41,779 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:42,139 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2025-01-09 22:16:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:42,141 INFO L225 Difference]: With dead ends: 122 [2025-01-09 22:16:42,141 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 22:16:42,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:42,142 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:42,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:16:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 22:16:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 22:16:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 121 states have internal predecessors, (140), 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:16:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2025-01-09 22:16:42,148 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 19 [2025-01-09 22:16:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2025-01-09 22:16:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2025-01-09 22:16:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:42,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:42,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:42,157 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:16:42,353 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 [2025-01-09 22:16:42,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2090137560, now seen corresponding path program 1 times [2025-01-09 22:16:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515121143] [2025-01-09 22:16:42,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:42,359 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:16:42,360 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:16:42,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:42,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:42,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:42,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:42,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:16:42,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:42,435 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:16:42,461 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:16:42,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:16:42,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 22:16:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:42,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:42,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515121143] [2025-01-09 22:16:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515121143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409721050] [2025-01-09 22:16:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:42,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:42,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:42,578 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:43,012 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2025-01-09 22:16:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:43,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:43,013 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:16:43,013 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:16:43,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:43,014 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:43,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 273 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:16:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:16:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2025-01-09 22:16:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 103 states have internal predecessors, (116), 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:16:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2025-01-09 22:16:43,020 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 19 [2025-01-09 22:16:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:43,020 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2025-01-09 22:16:43,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:16:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2025-01-09 22:16:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:43,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:43,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:43,029 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:16:43,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:43,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 691891406, now seen corresponding path program 1 times [2025-01-09 22:16:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331049148] [2025-01-09 22:16:43,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:43,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:43,228 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:16:43,229 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:16:43,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:43,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:16:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:43,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:16:43,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:16:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:43,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:43,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331049148] [2025-01-09 22:16:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331049148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362904100] [2025-01-09 22:16:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:43,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:43,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:43,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:43,423 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:16:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:43,741 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2025-01-09 22:16:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:43,742 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:16:43,742 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:16:43,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:43,743 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:43,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 285 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:16:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:16:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2025-01-09 22:16:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.423913043478261) internal successors, (131), 114 states have internal predecessors, (131), 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:16:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2025-01-09 22:16:43,749 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 19 [2025-01-09 22:16:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:43,749 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2025-01-09 22:16:43,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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:16:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2025-01-09 22:16:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:43,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:43,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:43,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:16:43,954 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 [2025-01-09 22:16:43,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -509806655, now seen corresponding path program 1 times [2025-01-09 22:16:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147277815] [2025-01-09 22:16:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:43,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:43,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:43,957 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:16:43,957 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:16:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:44,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:44,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:44,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:16:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:44,027 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 7 [2025-01-09 22:16:44,041 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:16:44,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:16:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:44,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:44,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147277815] [2025-01-09 22:16:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147277815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112437494] [2025-01-09 22:16:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:44,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:44,089 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:44,355 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-01-09 22:16:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:44,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:44,356 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:16:44,356 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:16:44,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:44,357 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:44,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:16:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:16:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 22:16:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 112 states have internal predecessors, (129), 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:16:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2025-01-09 22:16:44,362 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 21 [2025-01-09 22:16:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2025-01-09 22:16:44,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2025-01-09 22:16:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:44,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:44,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:44,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:16:44,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:44,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -509806654, now seen corresponding path program 1 times [2025-01-09 22:16:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091892470] [2025-01-09 22:16:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:44,566 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:16:44,567 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:16:44,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:44,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:44,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:44,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:44,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:16:44,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:44,648 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:16:44,669 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:16:44,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:16:44,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 22:16:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:44,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:44,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091892470] [2025-01-09 22:16:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091892470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997454169] [2025-01-09 22:16:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:44,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:44,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:44,746 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:45,053 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2025-01-09 22:16:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:45,054 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:16:45,054 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:16:45,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:45,055 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:45,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 240 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:16:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:16:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2025-01-09 22:16:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 96 states have internal predecessors, (111), 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:16:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-01-09 22:16:45,058 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 21 [2025-01-09 22:16:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:45,058 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-01-09 22:16:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:16:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-01-09 22:16:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:16:45,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:45,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:45,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:16:45,259 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 [2025-01-09 22:16:45,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:45,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1262416469, now seen corresponding path program 1 times [2025-01-09 22:16:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271518445] [2025-01-09 22:16:45,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:45,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:45,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:45,262 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:16:45,263 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:16:45,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:16:45,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:16:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:45,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:16:45,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:45,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:16:45,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:16:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:45,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:16:45,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:16:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271518445] [2025-01-09 22:16:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271518445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145197258] [2025-01-09 22:16:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:45,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:16:45,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:45,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:45,443 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:16:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:45,746 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2025-01-09 22:16:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2025-01-09 22:16:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:45,749 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:16:45,749 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:16:45,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:45,750 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:45,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 229 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:16:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:16:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2025-01-09 22:16:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 98 states have internal predecessors, (113), 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:16:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-01-09 22:16:45,756 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 21 [2025-01-09 22:16:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:45,756 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-01-09 22:16:45,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:16:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-01-09 22:16:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:16:45,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:45,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:45,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:16:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:45,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-09 22:16:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 545220426, now seen corresponding path program 1 times [2025-01-09 22:16:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:16:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884781428] [2025-01-09 22:16:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:45,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:16:46,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:46,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:46,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:46,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:16:46,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:16:46,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:46,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:46,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:46,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:16:46,072 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 22:16:46,073 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:16:46,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2025-01-09 22:16:46,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2025-01-09 22:16:46,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2025-01-09 22:16:46,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2025-01-09 22:16:46,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:16:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:46,280 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:46,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:16:46,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:16:46 BoogieIcfgContainer [2025-01-09 22:16:46,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:16:46,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:16:46,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:16:46,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:16:46,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:39" (3/4) ... [2025-01-09 22:16:46,302 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 22:16:46,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:16:46,303 INFO L158 Benchmark]: Toolchain (without parser) took 7771.15ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 58.4MB in the end (delta: 32.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-01-09 22:16:46,303 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:46,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.33ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 71.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:16:46,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.52ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:46,304 INFO L158 Benchmark]: Boogie Preprocessor took 62.66ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 67.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:46,304 INFO L158 Benchmark]: RCFGBuilder took 687.76ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 41.9MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 22:16:46,304 INFO L158 Benchmark]: TraceAbstraction took 6548.39ms. Allocated memory is still 117.4MB. Free memory was 41.4MB in the beginning and 58.4MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:46,304 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:16:46,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.33ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 71.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.52ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.66ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 67.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 687.76ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 41.9MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6548.39ms. Allocated memory is still 117.4MB. Free memory was 41.4MB in the beginning and 58.4MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={3:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={3:0}, i=0, p={3:0}, y=0] [L538] i < 10 && __VERIFIER_nondet_int() [L538] i < 10 && __VERIFIER_nondet_int() VAL [a={3:0}, i=0, p={3:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] y < 10 && __VERIFIER_nondet_int() [L546] y < 10 && __VERIFIER_nondet_int() VAL [a={3:0}, i=0, p={3:0}, y=0] [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 [L555] p->n = 0 [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={3:0}, i=0, p={3:0}, y=0] [L559] EXPR p->h [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 1711 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1112 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 599 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 19 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 22:16:46,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample