./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/uthash-2.0.2/uthash_SAX_test9-1.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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:27:16,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:27:16,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:27:16,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:27:16,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:27:16,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:27:16,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:27:16,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:27:16,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:27:16,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:27:16,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:27:16,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:27:16,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:27:16,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:27:16,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:27:16,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:27:16,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:27:16,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:27:16,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:27:16,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:27:16,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:27:16,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:27:16,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:27:16,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:27:16,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:27:16,413 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2025-02-06 12:27:16,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:27:16,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:27:16,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:27:16,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:27:16,685 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:27:16,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-02-06 12:27:17,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/532d336a7/f1affa13186742be8bfb08a77d722d32/FLAG124a01ca5 [2025-02-06 12:27:18,383 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:27:18,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-02-06 12:27:18,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/532d336a7/f1affa13186742be8bfb08a77d722d32/FLAG124a01ca5 [2025-02-06 12:27:18,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/532d336a7/f1affa13186742be8bfb08a77d722d32 [2025-02-06 12:27:18,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:27:18,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:27:18,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:27:18,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:27:18,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:27:18,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:27:18" (1/1) ... [2025-02-06 12:27:18,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5c667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:18, skipping insertion in model container [2025-02-06 12:27:18,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:27:18" (1/1) ... [2025-02-06 12:27:18,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:27:18,942 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:18,967 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:18,972 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:18,979 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:18,985 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:19,026 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:19,026 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:19,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:19,028 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:27:19,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:27:19,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:27:19,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:27:19,308 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:27:19,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19 WrapperNode [2025-02-06 12:27:19,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:27:19,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:27:19,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:27:19,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:27:19,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,423 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-02-06 12:27:19,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:27:19,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:27:19,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:27:19,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:27:19,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,490 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-06 12:27:19,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:27:19,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:27:19,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:27:19,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:27:19,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (1/1) ... [2025-02-06 12:27:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:27:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:27:19,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:27:19,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:27:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 12:27:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 12:27:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:27:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:27:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:27:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:27:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:27:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:27:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:27:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:27:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:27:19,631 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:27:19,631 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:27:19,631 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:27:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:27:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:27:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:27:19,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:27:19,782 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:27:22,627 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 12:27:22,903 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2025-02-06 12:27:22,903 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:27:23,002 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:27:23,002 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 12:27:23,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:27:23 BoogieIcfgContainer [2025-02-06 12:27:23,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:27:23,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:27:23,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:27:23,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:27:23,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:27:18" (1/3) ... [2025-02-06 12:27:23,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d487d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:27:23, skipping insertion in model container [2025-02-06 12:27:23,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:27:19" (2/3) ... [2025-02-06 12:27:23,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d487d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:27:23, skipping insertion in model container [2025-02-06 12:27:23,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:27:23" (3/3) ... [2025-02-06 12:27:23,012 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2025-02-06 12:27:23,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:27:23,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-1.i that has 6 procedures, 2085 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-02-06 12:27:23,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:27:23,122 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;@672079ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:27:23,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-02-06 12:27:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 2075 states, 1145 states have (on average 1.9956331877729259) internal successors, (2285), 2068 states have internal predecessors, (2285), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-06 12:27:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:27:23,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:23,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:27:23,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 4335405, now seen corresponding path program 1 times [2025-02-06 12:27:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803762294] [2025-02-06 12:27:23,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:23,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:27:23,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:27:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803762294] [2025-02-06 12:27:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803762294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:23,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:27:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968504777] [2025-02-06 12:27:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:23,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:23,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:23,331 INFO L87 Difference]: Start difference. First operand has 2075 states, 1145 states have (on average 1.9956331877729259) internal successors, (2285), 2068 states have internal predecessors, (2285), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:27:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:25,186 INFO L93 Difference]: Finished difference Result 2061 states and 3225 transitions. [2025-02-06 12:27:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:27:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:25,223 INFO L225 Difference]: With dead ends: 2061 [2025-02-06 12:27:25,223 INFO L226 Difference]: Without dead ends: 2059 [2025-02-06 12:27:25,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:25,228 INFO L435 NwaCegarLoop]: 2795 mSDtfsCounter, 2100 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2603 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:25,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2603 Valid, 2847 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:27:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2025-02-06 12:27:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2025-02-06 12:27:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1147 states have (on average 1.931124673060157) internal successors, (2215), 2052 states have internal predecessors, (2215), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 12:27:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3223 transitions. [2025-02-06 12:27:25,512 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3223 transitions. Word has length 3 [2025-02-06 12:27:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 3223 transitions. [2025-02-06 12:27:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:27:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3223 transitions. [2025-02-06 12:27:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:27:25,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:25,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:27:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:27:25,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 4335406, now seen corresponding path program 1 times [2025-02-06 12:27:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648185541] [2025-02-06 12:27:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:25,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:27:25,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:27:25,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:25,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:25,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648185541] [2025-02-06 12:27:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648185541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:25,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:25,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:27:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230124163] [2025-02-06 12:27:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:25,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:25,599 INFO L87 Difference]: Start difference. First operand 2059 states and 3223 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:27:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:26,876 INFO L93 Difference]: Finished difference Result 3831 states and 6147 transitions. [2025-02-06 12:27:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:27:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:26,894 INFO L225 Difference]: With dead ends: 3831 [2025-02-06 12:27:26,894 INFO L226 Difference]: Without dead ends: 3831 [2025-02-06 12:27:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:26,896 INFO L435 NwaCegarLoop]: 2897 mSDtfsCounter, 1916 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 5145 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:26,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2418 Valid, 5145 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:27:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2025-02-06 12:27:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3567. [2025-02-06 12:27:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 2156 states have (on average 1.913265306122449) internal successors, (4125), 3558 states have internal predecessors, (4125), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 6137 transitions. [2025-02-06 12:27:27,182 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 6137 transitions. Word has length 3 [2025-02-06 12:27:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:27,183 INFO L471 AbstractCegarLoop]: Abstraction has 3567 states and 6137 transitions. [2025-02-06 12:27:27,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:27:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 6137 transitions. [2025-02-06 12:27:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:27:27,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:27,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:27,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:27:27,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:27,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1146242659, now seen corresponding path program 1 times [2025-02-06 12:27:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:27,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272850714] [2025-02-06 12:27:27,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:27,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:27:27,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:27:27,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:27,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:27,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272850714] [2025-02-06 12:27:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272850714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:27:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813298061] [2025-02-06 12:27:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:27,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:27,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:27,285 INFO L87 Difference]: Start difference. First operand 3567 states and 6137 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:28,235 INFO L93 Difference]: Finished difference Result 4835 states and 8459 transitions. [2025-02-06 12:27:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:28,258 INFO L225 Difference]: With dead ends: 4835 [2025-02-06 12:27:28,258 INFO L226 Difference]: Without dead ends: 4835 [2025-02-06 12:27:28,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:28,260 INFO L435 NwaCegarLoop]: 4935 mSDtfsCounter, 2085 mSDsluCounter, 2291 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2588 SdHoareTripleChecker+Valid, 7226 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2588 Valid, 7226 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:27:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2025-02-06 12:27:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 3520. [2025-02-06 12:27:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2156 states have (on average 1.8803339517625233) internal successors, (4054), 3511 states have internal predecessors, (4054), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 6066 transitions. [2025-02-06 12:27:28,523 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 6066 transitions. Word has length 9 [2025-02-06 12:27:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:28,523 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 6066 transitions. [2025-02-06 12:27:28,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 6066 transitions. [2025-02-06 12:27:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:27:28,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:28,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:28,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:27:28,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:28,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1146242660, now seen corresponding path program 1 times [2025-02-06 12:27:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:28,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405693957] [2025-02-06 12:27:28,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:28,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:27:28,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:27:28,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:28,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405693957] [2025-02-06 12:27:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405693957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:27:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931336778] [2025-02-06 12:27:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:28,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:28,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:28,602 INFO L87 Difference]: Start difference. First operand 3520 states and 6066 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:30,175 INFO L93 Difference]: Finished difference Result 6050 states and 10812 transitions. [2025-02-06 12:27:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:30,199 INFO L225 Difference]: With dead ends: 6050 [2025-02-06 12:27:30,199 INFO L226 Difference]: Without dead ends: 6050 [2025-02-06 12:27:30,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:30,200 INFO L435 NwaCegarLoop]: 5087 mSDtfsCounter, 1876 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 7493 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:30,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2378 Valid, 7493 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:27:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2025-02-06 12:27:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3495. [2025-02-06 12:27:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 2156 states have (on average 1.8576066790352506) internal successors, (4005), 3486 states have internal predecessors, (4005), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 6017 transitions. [2025-02-06 12:27:30,611 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 6017 transitions. Word has length 9 [2025-02-06 12:27:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 6017 transitions. [2025-02-06 12:27:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 12:27:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 6017 transitions. [2025-02-06 12:27:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:27:30,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:30,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:30,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:27:30,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2082881526, now seen corresponding path program 1 times [2025-02-06 12:27:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695489275] [2025-02-06 12:27:30,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:30,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:27:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:27:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695489275] [2025-02-06 12:27:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695489275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:27:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063619019] [2025-02-06 12:27:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:30,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:27:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:30,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:27:30,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:27:30,696 INFO L87 Difference]: Start difference. First operand 3495 states and 6017 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-06 12:27:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:31,346 INFO L93 Difference]: Finished difference Result 6672 states and 11528 transitions. [2025-02-06 12:27:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:27:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-02-06 12:27:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:31,375 INFO L225 Difference]: With dead ends: 6672 [2025-02-06 12:27:31,378 INFO L226 Difference]: Without dead ends: 6672 [2025-02-06 12:27:31,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:27:31,378 INFO L435 NwaCegarLoop]: 3384 mSDtfsCounter, 2098 mSDsluCounter, 5927 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 9311 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:31,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 9311 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:27:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2025-02-06 12:27:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 3498. [2025-02-06 12:27:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 2159 states have (on average 1.856415006947661) internal successors, (4008), 3489 states have internal predecessors, (4008), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 6020 transitions. [2025-02-06 12:27:31,703 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 6020 transitions. Word has length 12 [2025-02-06 12:27:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 6020 transitions. [2025-02-06 12:27:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-02-06 12:27:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 6020 transitions. [2025-02-06 12:27:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 12:27:31,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:31,705 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-02-06 12:27:31,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:27:31,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -899481354, now seen corresponding path program 1 times [2025-02-06 12:27:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010772116] [2025-02-06 12:27:31,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:27:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:27:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010772116] [2025-02-06 12:27:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010772116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:27:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106533060] [2025-02-06 12:27:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:27:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:31,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:27:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:27:31,822 INFO L87 Difference]: Start difference. First operand 3498 states and 6020 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-02-06 12:27:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:33,765 INFO L93 Difference]: Finished difference Result 3573 states and 6126 transitions. [2025-02-06 12:27:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:27:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-02-06 12:27:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:33,774 INFO L225 Difference]: With dead ends: 3573 [2025-02-06 12:27:33,774 INFO L226 Difference]: Without dead ends: 3573 [2025-02-06 12:27:33,774 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-02-06 12:27:33,776 INFO L435 NwaCegarLoop]: 2697 mSDtfsCounter, 2349 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 4277 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:33,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 4277 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:27:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-02-06 12:27:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3475. [2025-02-06 12:27:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 2159 states have (on average 1.8351088466882817) internal successors, (3962), 3466 states have internal predecessors, (3962), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5974 transitions. [2025-02-06 12:27:33,970 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5974 transitions. Word has length 19 [2025-02-06 12:27:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:33,970 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 5974 transitions. [2025-02-06 12:27:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-02-06 12:27:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5974 transitions. [2025-02-06 12:27:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 12:27:33,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:33,971 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-02-06 12:27:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:27:33,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -899481353, now seen corresponding path program 1 times [2025-02-06 12:27:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353606495] [2025-02-06 12:27:33,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:33,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:27:33,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:27:33,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353606495] [2025-02-06 12:27:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353606495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:27:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666537391] [2025-02-06 12:27:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:34,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:34,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:34,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:34,054 INFO L87 Difference]: Start difference. First operand 3475 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02-06 12:27:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:34,120 INFO L93 Difference]: Finished difference Result 3337 states and 5768 transitions. [2025-02-06 12:27:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:34,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02-06 12:27:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:34,130 INFO L225 Difference]: With dead ends: 3337 [2025-02-06 12:27:34,130 INFO L226 Difference]: Without dead ends: 3337 [2025-02-06 12:27:34,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:34,130 INFO L435 NwaCegarLoop]: 2972 mSDtfsCounter, 60 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5891 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:34,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5891 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:27:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2025-02-06 12:27:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3337. [2025-02-06 12:27:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 2033 states have (on average 1.8475159862272503) internal successors, (3756), 3328 states have internal predecessors, (3756), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5768 transitions. [2025-02-06 12:27:34,335 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5768 transitions. Word has length 19 [2025-02-06 12:27:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5768 transitions. [2025-02-06 12:27:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-02-06 12:27:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5768 transitions. [2025-02-06 12:27:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:27:34,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:34,336 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] [2025-02-06 12:27:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:27:34,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2114239022, now seen corresponding path program 1 times [2025-02-06 12:27:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098383986] [2025-02-06 12:27:34,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:27:34,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:27:34,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:34,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098383986] [2025-02-06 12:27:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098383986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:27:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440896199] [2025-02-06 12:27:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:34,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:27:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:34,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:27:34,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:27:34,413 INFO L87 Difference]: Start difference. First operand 3337 states and 5768 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-02-06 12:27:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:34,534 INFO L93 Difference]: Finished difference Result 3308 states and 5718 transitions. [2025-02-06 12:27:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:27:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-02-06 12:27:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:34,543 INFO L225 Difference]: With dead ends: 3308 [2025-02-06 12:27:34,543 INFO L226 Difference]: Without dead ends: 3308 [2025-02-06 12:27:34,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:27:34,544 INFO L435 NwaCegarLoop]: 2937 mSDtfsCounter, 41 mSDsluCounter, 5846 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8783 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:34,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8783 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:27:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-02-06 12:27:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3302. [2025-02-06 12:27:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2005 states have (on average 1.8453865336658355) internal successors, (3700), 3293 states have internal predecessors, (3700), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 5712 transitions. [2025-02-06 12:27:34,775 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 5712 transitions. Word has length 20 [2025-02-06 12:27:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:34,776 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 5712 transitions. [2025-02-06 12:27:34,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-02-06 12:27:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 5712 transitions. [2025-02-06 12:27:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 12:27:34,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:34,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:34,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:27:34,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:34,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1725153960, now seen corresponding path program 1 times [2025-02-06 12:27:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53808753] [2025-02-06 12:27:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:34,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:27:34,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:27:34,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:34,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:34,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53808753] [2025-02-06 12:27:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53808753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:34,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:27:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16933326] [2025-02-06 12:27:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:34,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:27:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:34,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:27:34,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:27:34,936 INFO L87 Difference]: Start difference. First operand 3302 states and 5712 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02-06 12:27:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:37,037 INFO L93 Difference]: Finished difference Result 6090 states and 10835 transitions. [2025-02-06 12:27:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:27:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 12:27:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:37,048 INFO L225 Difference]: With dead ends: 6090 [2025-02-06 12:27:37,048 INFO L226 Difference]: Without dead ends: 6090 [2025-02-06 12:27:37,048 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-02-06 12:27:37,049 INFO L435 NwaCegarLoop]: 2775 mSDtfsCounter, 1825 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:37,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 6318 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:27:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2025-02-06 12:27:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 3298. [2025-02-06 12:27:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2005 states have (on average 1.8413965087281796) internal successors, (3692), 3289 states have internal predecessors, (3692), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 5704 transitions. [2025-02-06 12:27:37,344 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 5704 transitions. Word has length 34 [2025-02-06 12:27:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 3298 states and 5704 transitions. [2025-02-06 12:27:37,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-02-06 12:27:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 5704 transitions. [2025-02-06 12:27:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 12:27:37,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:37,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:27:37,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1721632597, now seen corresponding path program 1 times [2025-02-06 12:27:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378343292] [2025-02-06 12:27:37,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 12:27:37,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 12:27:37,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:37,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:37,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378343292] [2025-02-06 12:27:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378343292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:27:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181116156] [2025-02-06 12:27:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:27:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:37,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:27:37,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:27:37,475 INFO L87 Difference]: Start difference. First operand 3298 states and 5704 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 12:27:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:37,574 INFO L93 Difference]: Finished difference Result 3298 states and 5696 transitions. [2025-02-06 12:27:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:27:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2025-02-06 12:27:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:37,582 INFO L225 Difference]: With dead ends: 3298 [2025-02-06 12:27:37,582 INFO L226 Difference]: Without dead ends: 3298 [2025-02-06 12:27:37,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:27:37,582 INFO L435 NwaCegarLoop]: 2932 mSDtfsCounter, 21 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8765 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:37,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8765 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:27:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2025-02-06 12:27:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2025-02-06 12:27:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2005 states have (on average 1.8374064837905237) internal successors, (3684), 3289 states have internal predecessors, (3684), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-02-06 12:27:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 5696 transitions. [2025-02-06 12:27:37,751 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 5696 transitions. Word has length 69 [2025-02-06 12:27:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:37,751 INFO L471 AbstractCegarLoop]: Abstraction has 3298 states and 5696 transitions. [2025-02-06 12:27:37,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-06 12:27:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 5696 transitions. [2025-02-06 12:27:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:27:37,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:37,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:27:37,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1598792947, now seen corresponding path program 1 times [2025-02-06 12:27:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209324092] [2025-02-06 12:27:37,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:27:37,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:27:37,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:37,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:37,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209324092] [2025-02-06 12:27:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209324092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:27:37,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670808352] [2025-02-06 12:27:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:37,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:27:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:37,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:27:37,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:37,883 INFO L87 Difference]: Start difference. First operand 3298 states and 5696 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-02-06 12:27:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:38,008 INFO L93 Difference]: Finished difference Result 5808 states and 10418 transitions. [2025-02-06 12:27:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:27:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-02-06 12:27:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:38,021 INFO L225 Difference]: With dead ends: 5808 [2025-02-06 12:27:38,022 INFO L226 Difference]: Without dead ends: 5808 [2025-02-06 12:27:38,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:27:38,023 INFO L435 NwaCegarLoop]: 3224 mSDtfsCounter, 1354 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 6125 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:38,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 6125 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:27:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2025-02-06 12:27:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 5751. [2025-02-06 12:27:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5751 states, 3458 states have (on average 1.8516483516483517) internal successors, (6403), 5742 states have internal predecessors, (6403), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-02-06 12:27:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 10415 transitions. [2025-02-06 12:27:38,359 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 10415 transitions. Word has length 77 [2025-02-06 12:27:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:38,359 INFO L471 AbstractCegarLoop]: Abstraction has 5751 states and 10415 transitions. [2025-02-06 12:27:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-02-06 12:27:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 10415 transitions. [2025-02-06 12:27:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:27:38,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:38,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:38,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:27:38,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 657625240, now seen corresponding path program 1 times [2025-02-06 12:27:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:38,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360761345] [2025-02-06 12:27:38,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:27:38,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:27:38,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:38,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360761345] [2025-02-06 12:27:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360761345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:27:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685011199] [2025-02-06 12:27:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:27:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:27:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:27:38,624 INFO L87 Difference]: Start difference. First operand 5751 states and 10415 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 12:27:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:39,244 INFO L93 Difference]: Finished difference Result 5750 states and 10413 transitions. [2025-02-06 12:27:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:27:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2025-02-06 12:27:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:39,260 INFO L225 Difference]: With dead ends: 5750 [2025-02-06 12:27:39,261 INFO L226 Difference]: Without dead ends: 5750 [2025-02-06 12:27:39,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:27:39,262 INFO L435 NwaCegarLoop]: 2942 mSDtfsCounter, 2 mSDsluCounter, 7835 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10777 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:39,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10777 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:27:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2025-02-06 12:27:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 5750. [2025-02-06 12:27:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5750 states, 3458 states have (on average 1.85106998264893) internal successors, (6401), 5741 states have internal predecessors, (6401), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-02-06 12:27:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 10413 transitions. [2025-02-06 12:27:39,588 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 10413 transitions. Word has length 85 [2025-02-06 12:27:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:39,589 INFO L471 AbstractCegarLoop]: Abstraction has 5750 states and 10413 transitions. [2025-02-06 12:27:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 12:27:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 10413 transitions. [2025-02-06 12:27:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:27:39,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:39,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:27:39,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 657625241, now seen corresponding path program 1 times [2025-02-06 12:27:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10773447] [2025-02-06 12:27:39,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:27:39,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:27:39,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:39,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:39,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:39,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10773447] [2025-02-06 12:27:39,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10773447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:39,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:39,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:27:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824205615] [2025-02-06 12:27:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:39,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:27:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:27:39,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:27:39,974 INFO L87 Difference]: Start difference. First operand 5750 states and 10413 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 12:27:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:40,667 INFO L93 Difference]: Finished difference Result 5749 states and 10411 transitions. [2025-02-06 12:27:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:27:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2025-02-06 12:27:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:40,679 INFO L225 Difference]: With dead ends: 5749 [2025-02-06 12:27:40,679 INFO L226 Difference]: Without dead ends: 5749 [2025-02-06 12:27:40,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:27:40,680 INFO L435 NwaCegarLoop]: 2942 mSDtfsCounter, 1 mSDsluCounter, 7773 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10715 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:40,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10715 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:27:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2025-02-06 12:27:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 5749. [2025-02-06 12:27:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5749 states, 3456 states have (on average 1.8515625) internal successors, (6399), 5740 states have internal predecessors, (6399), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-02-06 12:27:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5749 states to 5749 states and 10411 transitions. [2025-02-06 12:27:41,100 INFO L78 Accepts]: Start accepts. Automaton has 5749 states and 10411 transitions. Word has length 85 [2025-02-06 12:27:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:41,100 INFO L471 AbstractCegarLoop]: Abstraction has 5749 states and 10411 transitions. [2025-02-06 12:27:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-02-06 12:27:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5749 states and 10411 transitions. [2025-02-06 12:27:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 12:27:41,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:41,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:27:41,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 950701525, now seen corresponding path program 1 times [2025-02-06 12:27:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58014828] [2025-02-06 12:27:41,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:41,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 12:27:41,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 12:27:41,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:41,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58014828] [2025-02-06 12:27:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58014828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:27:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396905562] [2025-02-06 12:27:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:27:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:41,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:27:41,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:27:41,366 INFO L87 Difference]: Start difference. First operand 5749 states and 10411 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:27:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:44,785 INFO L93 Difference]: Finished difference Result 5767 states and 10437 transitions. [2025-02-06 12:27:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:27:44,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-02-06 12:27:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:44,800 INFO L225 Difference]: With dead ends: 5767 [2025-02-06 12:27:44,800 INFO L226 Difference]: Without dead ends: 5767 [2025-02-06 12:27:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:27:44,801 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 13 mSDsluCounter, 8303 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11230 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 3652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11230 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-06 12:27:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2025-02-06 12:27:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5758. [2025-02-06 12:27:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 3464 states have (on average 1.8504618937644342) internal successors, (6410), 5747 states have internal predecessors, (6410), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-02-06 12:27:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 10427 transitions. [2025-02-06 12:27:45,100 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 10427 transitions. Word has length 93 [2025-02-06 12:27:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 10427 transitions. [2025-02-06 12:27:45,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:27:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 10427 transitions. [2025-02-06 12:27:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 12:27:45,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:45,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:45,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:27:45,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:45,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash 950701526, now seen corresponding path program 1 times [2025-02-06 12:27:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:45,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772738415] [2025-02-06 12:27:45,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 12:27:45,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 12:27:45,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:45,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772738415] [2025-02-06 12:27:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772738415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:27:45,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:27:45,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:27:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970208452] [2025-02-06 12:27:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:27:45,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:27:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:45,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:27:45,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:27:45,514 INFO L87 Difference]: Start difference. First operand 5758 states and 10427 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:27:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:48,143 INFO L93 Difference]: Finished difference Result 5758 states and 10425 transitions. [2025-02-06 12:27:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:27:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-02-06 12:27:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:48,178 INFO L225 Difference]: With dead ends: 5758 [2025-02-06 12:27:48,181 INFO L226 Difference]: Without dead ends: 5758 [2025-02-06 12:27:48,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:27:48,182 INFO L435 NwaCegarLoop]: 2931 mSDtfsCounter, 8 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10997 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:48,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10997 Invalid, 3872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 12:27:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2025-02-06 12:27:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5758. [2025-02-06 12:27:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 3464 states have (on average 1.8498845265588915) internal successors, (6408), 5747 states have internal predecessors, (6408), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-02-06 12:27:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 10425 transitions. [2025-02-06 12:27:48,526 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 10425 transitions. Word has length 93 [2025-02-06 12:27:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 10425 transitions. [2025-02-06 12:27:48,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:27:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 10425 transitions. [2025-02-06 12:27:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:27:48,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:48,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:27:48,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2142807410, now seen corresponding path program 1 times [2025-02-06 12:27:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054360803] [2025-02-06 12:27:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:27:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:27:48,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:48,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054360803] [2025-02-06 12:27:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054360803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:27:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901445206] [2025-02-06 12:27:48,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:48,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:27:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:27:48,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:27:48,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:27:49,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:27:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:27:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:49,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:49,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:27:49,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:27:49,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:27:49,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:27:49,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:27:49,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:27:49,386 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 22 treesize of output 10 [2025-02-06 12:27:49,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:27:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:27:49,564 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 31 treesize of output 13 [2025-02-06 12:27:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:49,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:27:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901445206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:27:49,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:27:49,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-06 12:27:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102645801] [2025-02-06 12:27:49,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:27:49,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:27:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:49,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:27:49,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=320, Unknown=4, NotChecked=0, Total=380 [2025-02-06 12:27:49,644 INFO L87 Difference]: Start difference. First operand 5758 states and 10425 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:27:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:27:57,866 INFO L93 Difference]: Finished difference Result 5765 states and 10431 transitions. [2025-02-06 12:27:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:27:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-02-06 12:27:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:27:57,884 INFO L225 Difference]: With dead ends: 5765 [2025-02-06 12:27:57,885 INFO L226 Difference]: Without dead ends: 5765 [2025-02-06 12:27:57,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=465, Unknown=4, NotChecked=0, Total=552 [2025-02-06 12:27:57,885 INFO L435 NwaCegarLoop]: 2595 mSDtfsCounter, 1885 mSDsluCounter, 19405 mSDsCounter, 0 mSdLazyCounter, 13718 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 22000 SdHoareTripleChecker+Invalid, 14235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 13718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:27:57,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 22000 Invalid, 14235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 13718 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-02-06 12:27:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2025-02-06 12:27:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5762. [2025-02-06 12:27:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5762 states, 3468 states have (on average 1.8486159169550174) internal successors, (6411), 5750 states have internal predecessors, (6411), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-02-06 12:27:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5762 states to 5762 states and 10425 transitions. [2025-02-06 12:27:58,264 INFO L78 Accepts]: Start accepts. Automaton has 5762 states and 10425 transitions. Word has length 94 [2025-02-06 12:27:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:27:58,265 INFO L471 AbstractCegarLoop]: Abstraction has 5762 states and 10425 transitions. [2025-02-06 12:27:58,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:27:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5762 states and 10425 transitions. [2025-02-06 12:27:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:27:58,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:27:58,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:27:58,277 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-02-06 12:27:58,470 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,SelfDestructingSolverStorable15 [2025-02-06 12:27:58,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:27:58,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:27:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2142807411, now seen corresponding path program 1 times [2025-02-06 12:27:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:27:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415043331] [2025-02-06 12:27:58,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:27:58,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:27:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:27:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:27:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415043331] [2025-02-06 12:27:59,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415043331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:27:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709598200] [2025-02-06 12:27:59,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:27:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:27:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:27:59,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:27:59,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:27:59,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:27:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:27:59,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:27:59,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:27:59,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:27:59,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:27:59,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:27:59,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:27:59,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:27:59,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:27:59,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:27:59,356 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-02-06 12:27:59,432 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 22 treesize of output 10 [2025-02-06 12:27:59,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:27:59,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:27:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:27:59,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:27:59,571 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 31 treesize of output 13 [2025-02-06 12:27:59,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:27:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:27:59,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:27:59,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_730 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:27:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709598200] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:27:59,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:27:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-02-06 12:27:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780179656] [2025-02-06 12:27:59,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:27:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:27:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:27:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:27:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-06 12:27:59,678 INFO L87 Difference]: Start difference. First operand 5762 states and 10425 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:28:08,762 INFO L93 Difference]: Finished difference Result 5764 states and 10429 transitions. [2025-02-06 12:28:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:28:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-02-06 12:28:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:28:08,774 INFO L225 Difference]: With dead ends: 5764 [2025-02-06 12:28:08,774 INFO L226 Difference]: Without dead ends: 5764 [2025-02-06 12:28:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-02-06 12:28:08,775 INFO L435 NwaCegarLoop]: 2598 mSDtfsCounter, 1881 mSDsluCounter, 20859 mSDsCounter, 0 mSdLazyCounter, 12767 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 23457 SdHoareTripleChecker+Invalid, 13286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 12767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:28:08,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 23457 Invalid, 13286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [519 Valid, 12767 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-02-06 12:28:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2025-02-06 12:28:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 5752. [2025-02-06 12:28:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 3460 states have (on average 1.8497109826589595) internal successors, (6400), 5742 states have internal predecessors, (6400), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-02-06 12:28:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 10412 transitions. [2025-02-06 12:28:09,122 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 10412 transitions. Word has length 94 [2025-02-06 12:28:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:28:09,122 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 10412 transitions. [2025-02-06 12:28:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 10412 transitions. [2025-02-06 12:28:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:28:09,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:28:09,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:28:09,132 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-02-06 12:28:09,328 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,SelfDestructingSolverStorable16 [2025-02-06 12:28:09,328 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:28:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:28:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1338638164, now seen corresponding path program 1 times [2025-02-06 12:28:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:28:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479798414] [2025-02-06 12:28:09,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:28:09,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:28:09,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:28:09,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:09,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:09,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:28:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479798414] [2025-02-06 12:28:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479798414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:28:09,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:28:09,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:28:09,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710052320] [2025-02-06 12:28:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:28:09,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:28:09,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:28:09,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:28:09,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:28:09,884 INFO L87 Difference]: Start difference. First operand 5752 states and 10412 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:28:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:28:14,764 INFO L93 Difference]: Finished difference Result 5771 states and 10437 transitions. [2025-02-06 12:28:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:28:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-02-06 12:28:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:28:14,782 INFO L225 Difference]: With dead ends: 5771 [2025-02-06 12:28:14,782 INFO L226 Difference]: Without dead ends: 5771 [2025-02-06 12:28:14,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:28:14,784 INFO L435 NwaCegarLoop]: 2595 mSDtfsCounter, 1910 mSDsluCounter, 14163 mSDsCounter, 0 mSdLazyCounter, 10058 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2414 SdHoareTripleChecker+Valid, 16758 SdHoareTripleChecker+Invalid, 10571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 10058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:28:14,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2414 Valid, 16758 Invalid, 10571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 10058 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-06 12:28:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2025-02-06 12:28:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5767. [2025-02-06 12:28:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 3474 states have (on average 1.8471502590673574) internal successors, (6417), 5755 states have internal predecessors, (6417), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-02-06 12:28:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 10431 transitions. [2025-02-06 12:28:15,136 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 10431 transitions. Word has length 96 [2025-02-06 12:28:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:28:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 10431 transitions. [2025-02-06 12:28:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:28:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 10431 transitions. [2025-02-06 12:28:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:28:15,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:28:15,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:28:15,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:28:15,138 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:28:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:28:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1338638165, now seen corresponding path program 1 times [2025-02-06 12:28:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:28:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978424915] [2025-02-06 12:28:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:28:15,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:28:15,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:28:15,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:15,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:28:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978424915] [2025-02-06 12:28:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978424915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:28:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:28:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:28:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196952343] [2025-02-06 12:28:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:28:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:28:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:28:15,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:28:15,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:28:15,598 INFO L87 Difference]: Start difference. First operand 5767 states and 10431 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:28:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:28:22,151 INFO L93 Difference]: Finished difference Result 5770 states and 10435 transitions. [2025-02-06 12:28:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:28:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-02-06 12:28:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:28:22,167 INFO L225 Difference]: With dead ends: 5770 [2025-02-06 12:28:22,171 INFO L226 Difference]: Without dead ends: 5770 [2025-02-06 12:28:22,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:28:22,172 INFO L435 NwaCegarLoop]: 2599 mSDtfsCounter, 1908 mSDsluCounter, 14969 mSDsCounter, 0 mSdLazyCounter, 8652 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 17568 SdHoareTripleChecker+Invalid, 9164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 8652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:28:22,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 17568 Invalid, 9164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 8652 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-02-06 12:28:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2025-02-06 12:28:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2025-02-06 12:28:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 3474 states have (on average 1.84657455382844) internal successors, (6415), 5755 states have internal predecessors, (6415), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-02-06 12:28:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 10429 transitions. [2025-02-06 12:28:22,631 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 10429 transitions. Word has length 96 [2025-02-06 12:28:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:28:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 10429 transitions. [2025-02-06 12:28:22,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:28:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 10429 transitions. [2025-02-06 12:28:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:28:22,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:28:22,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:28:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:28:22,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:28:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:28:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 280487575, now seen corresponding path program 1 times [2025-02-06 12:28:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:28:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254724373] [2025-02-06 12:28:22,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:28:22,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:28:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:28:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:28:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254724373] [2025-02-06 12:28:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254724373] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:28:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398906891] [2025-02-06 12:28:23,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:28:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:28:23,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:28:23,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:28:23,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:28:23,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:28:23,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:23,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:23,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:28:23,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:28:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:28:23,338 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:28:23,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:28:23,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:28:23,416 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 22 treesize of output 10 [2025-02-06 12:28:23,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:28:23,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:28:23,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:28:23,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:28:23,576 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 31 treesize of output 13 [2025-02-06 12:28:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:23,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:28:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398906891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:28:23,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:28:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-06 12:28:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911978109] [2025-02-06 12:28:23,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:28:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:28:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:28:23,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:28:23,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=483, Unknown=34, NotChecked=0, Total=600 [2025-02-06 12:28:23,701 INFO L87 Difference]: Start difference. First operand 5767 states and 10429 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:28:31,251 INFO L93 Difference]: Finished difference Result 5769 states and 10433 transitions. [2025-02-06 12:28:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:28:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-02-06 12:28:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:28:31,260 INFO L225 Difference]: With dead ends: 5769 [2025-02-06 12:28:31,260 INFO L226 Difference]: Without dead ends: 5769 [2025-02-06 12:28:31,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=615, Unknown=36, NotChecked=0, Total=756 [2025-02-06 12:28:31,261 INFO L435 NwaCegarLoop]: 2594 mSDtfsCounter, 1880 mSDsluCounter, 15738 mSDsCounter, 0 mSdLazyCounter, 12465 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 18332 SdHoareTripleChecker+Invalid, 12978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 12465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:28:31,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 18332 Invalid, 12978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 12465 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-02-06 12:28:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2025-02-06 12:28:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5766. [2025-02-06 12:28:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5766 states, 3474 states have (on average 1.8459988485895222) internal successors, (6413), 5754 states have internal predecessors, (6413), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-02-06 12:28:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 10427 transitions. [2025-02-06 12:28:31,609 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 10427 transitions. Word has length 97 [2025-02-06 12:28:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:28:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 5766 states and 10427 transitions. [2025-02-06 12:28:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 10427 transitions. [2025-02-06 12:28:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:28:31,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:28:31,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:28:31,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:28:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:28:31,811 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:28:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:28:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 280487576, now seen corresponding path program 1 times [2025-02-06 12:28:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:28:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315020812] [2025-02-06 12:28:31,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:28:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:28:31,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:28:31,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:31,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:28:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315020812] [2025-02-06 12:28:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315020812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:28:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269588706] [2025-02-06 12:28:32,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:28:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:28:32,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:28:32,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:28:32,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:28:32,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:28:32,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:32,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:32,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 12:28:32,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:28:32,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:28:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:28:32,789 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:28:32,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:28:32,809 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-02-06 12:28:32,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:28:32,870 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 22 treesize of output 10 [2025-02-06 12:28:32,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:28:32,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:28:32,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:28:32,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:28:32,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:28:33,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:28:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:28:33,014 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 31 treesize of output 13 [2025-02-06 12:28:33,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:28:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:33,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:28:33,221 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:28:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269588706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:28:33,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:28:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 12:28:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933081474] [2025-02-06 12:28:33,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:28:33,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:28:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:28:33,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:28:33,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=454, Unknown=22, NotChecked=44, Total=600 [2025-02-06 12:28:33,224 INFO L87 Difference]: Start difference. First operand 5766 states and 10427 transitions. Second operand has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:28:42,780 INFO L93 Difference]: Finished difference Result 5768 states and 10431 transitions. [2025-02-06 12:28:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:28:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-02-06 12:28:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:28:42,787 INFO L225 Difference]: With dead ends: 5768 [2025-02-06 12:28:42,787 INFO L226 Difference]: Without dead ends: 5768 [2025-02-06 12:28:42,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=666, Unknown=22, NotChecked=54, Total=870 [2025-02-06 12:28:42,788 INFO L435 NwaCegarLoop]: 2597 mSDtfsCounter, 1881 mSDsluCounter, 20349 mSDsCounter, 0 mSdLazyCounter, 12236 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 22946 SdHoareTripleChecker+Invalid, 12753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:28:42,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 22946 Invalid, 12753 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 12236 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-02-06 12:28:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2025-02-06 12:28:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5750. [2025-02-06 12:28:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5750 states, 3460 states have (on average 1.8485549132947976) internal successors, (6396), 5740 states have internal predecessors, (6396), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-02-06 12:28:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 10408 transitions. [2025-02-06 12:28:43,122 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 10408 transitions. Word has length 97 [2025-02-06 12:28:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:28:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 5750 states and 10408 transitions. [2025-02-06 12:28:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:28:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 10408 transitions. [2025-02-06 12:28:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:28:43,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:28:43,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:28:43,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:28:43,328 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,SelfDestructingSolverStorable20 [2025-02-06 12:28:43,328 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:28:43,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:28:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 602050126, now seen corresponding path program 1 times [2025-02-06 12:28:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:28:43,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549884071] [2025-02-06 12:28:43,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:28:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:28:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:28:43,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:28:43,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:28:43,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:28:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:28:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:28:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549884071] [2025-02-06 12:28:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549884071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:28:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:28:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:28:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818117767] [2025-02-06 12:28:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:28:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:28:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:28:43,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:28:43,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:28:43,714 INFO L87 Difference]: Start difference. First operand 5750 states and 10408 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)