./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:38:10,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:38:10,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:38:10,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:38:10,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:38:10,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:38:10,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:38:10,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:38:10,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:38:10,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:38:10,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:38:10,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:38:10,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:38:10,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:38:10,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:38:10,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:38:10,651 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:38:10,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:38:10,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:38:10,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:38:10,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:38:10,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:38:10,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:38:10,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:38:10,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:38:10,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:38:10,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:38:10,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:38:10,654 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/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-09 00:38:10,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:38:10,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:38:10,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:38:10,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:38:10,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:38:10,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-03-09 00:38:12,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcc5399/41866436c4014280be638f503bc581da/FLAG6c6c860ec [2025-03-09 00:38:12,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:38:12,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-03-09 00:38:12,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcc5399/41866436c4014280be638f503bc581da/FLAG6c6c860ec [2025-03-09 00:38:12,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcc5399/41866436c4014280be638f503bc581da [2025-03-09 00:38:12,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:38:12,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:38:12,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:38:12,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:38:12,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:38:12,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:38:12" (1/1) ... [2025-03-09 00:38:12,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c6f558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:12, skipping insertion in model container [2025-03-09 00:38:12,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:38:12" (1/1) ... [2025-03-09 00:38:12,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:38:12,902 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,934 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,939 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,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-03-09 00:38:12,950 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,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-03-09 00:38:12,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-03-09 00:38:12,974 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,974 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:38:12,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:38:12,991 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:38:13,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:38:13,098 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:38:13,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13 WrapperNode [2025-03-09 00:38:13,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:38:13,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:38:13,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:38:13,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:38:13,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,186 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-03-09 00:38:13,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:38:13,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:38:13,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:38:13,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:38:13,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,248 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 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-03-09 00:38:13,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:38:13,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:38:13,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:38:13,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:38:13,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (1/1) ... [2025-03-09 00:38:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:38:13,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:13,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:38:13,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 00:38:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:38:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:38:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 00:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:38:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:38:13,485 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:38:13,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:38:14,887 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: 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-03-09 00:38:14,959 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-03-09 00:38:14,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:38:15,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:38:15,005 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 00:38:15,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:38:15 BoogieIcfgContainer [2025-03-09 00:38:15,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:38:15,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:38:15,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:38:15,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:38:15,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:38:12" (1/3) ... [2025-03-09 00:38:15,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125142a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:38:15, skipping insertion in model container [2025-03-09 00:38:15,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:13" (2/3) ... [2025-03-09 00:38:15,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125142a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:38:15, skipping insertion in model container [2025-03-09 00:38:15,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:38:15" (3/3) ... [2025-03-09 00:38:15,021 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-03-09 00:38:15,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:38:15,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 1058 locations, 1 initial locations, 31 loop locations, and 420 error locations. [2025-03-09 00:38:15,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:38:15,094 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;@4142ecb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:38:15,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-03-09 00:38:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:38:15,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:15,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:38:15,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 41525260, now seen corresponding path program 1 times [2025-03-09 00:38:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503964823] [2025-03-09 00:38:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:38:15,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:38:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:15,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503964823] [2025-03-09 00:38:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503964823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326361823] [2025-03-09 00:38:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:15,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:15,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:15,326 INFO L87 Difference]: Start difference. First operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:16,170 INFO L93 Difference]: Finished difference Result 1342 states and 1595 transitions. [2025-03-09 00:38:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:38:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:16,187 INFO L225 Difference]: With dead ends: 1342 [2025-03-09 00:38:16,187 INFO L226 Difference]: Without dead ends: 1338 [2025-03-09 00:38:16,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:16,190 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 380 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:16,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2510 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:38:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-09 00:38:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1253. [2025-03-09 00:38:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 837 states have (on average 1.8888888888888888) internal successors, (1581), 1248 states have internal predecessors, (1581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1587 transitions. [2025-03-09 00:38:16,292 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1587 transitions. Word has length 4 [2025-03-09 00:38:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:16,293 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1587 transitions. [2025-03-09 00:38:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1587 transitions. [2025-03-09 00:38:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:38:16,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:16,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:38:16,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:38:16,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 41526588, now seen corresponding path program 1 times [2025-03-09 00:38:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:16,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124803528] [2025-03-09 00:38:16,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:16,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:38:16,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:38:16,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:16,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124803528] [2025-03-09 00:38:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124803528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218679577] [2025-03-09 00:38:16,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:16,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:16,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:16,338 INFO L87 Difference]: Start difference. First operand 1253 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:16,753 INFO L93 Difference]: Finished difference Result 1250 states and 1579 transitions. [2025-03-09 00:38:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:38:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:16,757 INFO L225 Difference]: With dead ends: 1250 [2025-03-09 00:38:16,757 INFO L226 Difference]: Without dead ends: 1250 [2025-03-09 00:38:16,758 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-03-09 00:38:16,758 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1081 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:16,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 815 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-09 00:38:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-09 00:38:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 845 states have (on average 1.8615384615384616) internal successors, (1573), 1245 states have internal predecessors, (1573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1579 transitions. [2025-03-09 00:38:16,783 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1579 transitions. Word has length 4 [2025-03-09 00:38:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:16,783 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1579 transitions. [2025-03-09 00:38:16,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 00:38:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1579 transitions. [2025-03-09 00:38:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:38:16,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:16,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:38:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:38:16,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 41526589, now seen corresponding path program 1 times [2025-03-09 00:38:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587698876] [2025-03-09 00:38:16,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:16,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:38:16,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:38:16,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587698876] [2025-03-09 00:38:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587698876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934569902] [2025-03-09 00:38:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:16,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:16,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:16,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:16,874 INFO L87 Difference]: Start difference. First operand 1250 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:17,615 INFO L93 Difference]: Finished difference Result 2005 states and 2479 transitions. [2025-03-09 00:38:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:38:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:17,622 INFO L225 Difference]: With dead ends: 2005 [2025-03-09 00:38:17,622 INFO L226 Difference]: Without dead ends: 2005 [2025-03-09 00:38:17,622 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-03-09 00:38:17,625 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 899 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1601 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:38:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-03-09 00:38:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1743. [2025-03-09 00:38:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1339 states have (on average 1.8356982823002241) internal successors, (2458), 1736 states have internal predecessors, (2458), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2468 transitions. [2025-03-09 00:38:17,660 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2468 transitions. Word has length 4 [2025-03-09 00:38:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2468 transitions. [2025-03-09 00:38:17,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 00:38:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2468 transitions. [2025-03-09 00:38:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:38:17,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:17,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:17,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:38:17,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:17,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash -539402885, now seen corresponding path program 1 times [2025-03-09 00:38:17,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598347228] [2025-03-09 00:38:17,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:17,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:38:17,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:38:17,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:17,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598347228] [2025-03-09 00:38:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598347228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:17,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876404722] [2025-03-09 00:38:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:17,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:17,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:17,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:17,745 INFO L87 Difference]: Start difference. First operand 1743 states and 2468 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-03-09 00:38:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:18,265 INFO L93 Difference]: Finished difference Result 1781 states and 2399 transitions. [2025-03-09 00:38:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:18,265 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-03-09 00:38:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:18,270 INFO L225 Difference]: With dead ends: 1781 [2025-03-09 00:38:18,270 INFO L226 Difference]: Without dead ends: 1781 [2025-03-09 00:38:18,270 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-03-09 00:38:18,271 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 1066 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:18,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1330 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-09 00:38:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1696. [2025-03-09 00:38:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1339 states have (on average 1.782673637042569) internal successors, (2387), 1689 states have internal predecessors, (2387), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2397 transitions. [2025-03-09 00:38:18,296 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2397 transitions. Word has length 9 [2025-03-09 00:38:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:18,296 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2397 transitions. [2025-03-09 00:38:18,296 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-03-09 00:38:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2397 transitions. [2025-03-09 00:38:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:38:18,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:18,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:18,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:38:18,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:18,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -539402884, now seen corresponding path program 1 times [2025-03-09 00:38:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903983646] [2025-03-09 00:38:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:18,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:38:18,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:38:18,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:18,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903983646] [2025-03-09 00:38:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903983646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:18,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651518282] [2025-03-09 00:38:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:18,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:18,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:18,366 INFO L87 Difference]: Start difference. First operand 1696 states and 2397 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-03-09 00:38:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:18,807 INFO L93 Difference]: Finished difference Result 1987 states and 2739 transitions. [2025-03-09 00:38:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:18,807 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-03-09 00:38:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:18,813 INFO L225 Difference]: With dead ends: 1987 [2025-03-09 00:38:18,813 INFO L226 Difference]: Without dead ends: 1987 [2025-03-09 00:38:18,813 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-03-09 00:38:18,814 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 859 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:18,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1574 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-09 00:38:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1671. [2025-03-09 00:38:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1339 states have (on average 1.7460791635548918) internal successors, (2338), 1664 states have internal predecessors, (2338), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2348 transitions. [2025-03-09 00:38:18,843 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2348 transitions. Word has length 9 [2025-03-09 00:38:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2348 transitions. [2025-03-09 00:38:18,844 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-03-09 00:38:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2348 transitions. [2025-03-09 00:38:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 00:38:18,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:18,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:38:18,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:18,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546303, now seen corresponding path program 1 times [2025-03-09 00:38:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:18,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558823964] [2025-03-09 00:38:18,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:38:18,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:38:18,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558823964] [2025-03-09 00:38:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558823964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822991696] [2025-03-09 00:38:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:18,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:18,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:18,913 INFO L87 Difference]: Start difference. First operand 1671 states and 2348 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:19,364 INFO L93 Difference]: Finished difference Result 1795 states and 2507 transitions. [2025-03-09 00:38:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:19,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 00:38:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:19,369 INFO L225 Difference]: With dead ends: 1795 [2025-03-09 00:38:19,369 INFO L226 Difference]: Without dead ends: 1795 [2025-03-09 00:38:19,369 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-03-09 00:38:19,369 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1281 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:19,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1318 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-09 00:38:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1648. [2025-03-09 00:38:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1339 states have (on average 1.6945481702763256) internal successors, (2269), 1641 states have internal predecessors, (2269), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2279 transitions. [2025-03-09 00:38:19,407 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2279 transitions. Word has length 13 [2025-03-09 00:38:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:19,408 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2279 transitions. [2025-03-09 00:38:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2279 transitions. [2025-03-09 00:38:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 00:38:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:19,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:19,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:38:19,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546304, now seen corresponding path program 1 times [2025-03-09 00:38:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772608102] [2025-03-09 00:38:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:38:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:38:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772608102] [2025-03-09 00:38:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772608102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:19,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690117915] [2025-03-09 00:38:19,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:19,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:19,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:19,467 INFO L87 Difference]: Start difference. First operand 1648 states and 2279 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:19,523 INFO L93 Difference]: Finished difference Result 1447 states and 1970 transitions. [2025-03-09 00:38:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:19,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 00:38:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:19,527 INFO L225 Difference]: With dead ends: 1447 [2025-03-09 00:38:19,527 INFO L226 Difference]: Without dead ends: 1447 [2025-03-09 00:38:19,527 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-03-09 00:38:19,528 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 60 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1839 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-03-09 00:38:19,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1839 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:38:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-09 00:38:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-09 00:38:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1150 states have (on average 1.7043478260869565) internal successors, (1960), 1440 states have internal predecessors, (1960), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1970 transitions. [2025-03-09 00:38:19,546 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1970 transitions. Word has length 13 [2025-03-09 00:38:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:19,546 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1970 transitions. [2025-03-09 00:38:19,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1970 transitions. [2025-03-09 00:38:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:38:19,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:19,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:38:19,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:19,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 966072339, now seen corresponding path program 1 times [2025-03-09 00:38:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372981086] [2025-03-09 00:38:19,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:19,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:38:19,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:38:19,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372981086] [2025-03-09 00:38:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372981086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389786788] [2025-03-09 00:38:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:19,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:19,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:19,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:19,594 INFO L87 Difference]: Start difference. First operand 1447 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-09 00:38:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:19,683 INFO L93 Difference]: Finished difference Result 1416 states and 1904 transitions. [2025-03-09 00:38:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:38:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-09 00:38:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:19,687 INFO L225 Difference]: With dead ends: 1416 [2025-03-09 00:38:19,687 INFO L226 Difference]: Without dead ends: 1416 [2025-03-09 00:38:19,688 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-03-09 00:38:19,688 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 45 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:19,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2701 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-09 00:38:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2025-03-09 00:38:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1126 states have (on average 1.6820603907637655) internal successors, (1894), 1409 states have internal predecessors, (1894), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2025-03-09 00:38:19,707 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 14 [2025-03-09 00:38:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:19,707 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2025-03-09 00:38:19,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-09 00:38:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2025-03-09 00:38:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:38:19,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:19,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:19,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:38:19,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:19,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185868, now seen corresponding path program 1 times [2025-03-09 00:38:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103382317] [2025-03-09 00:38:19,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:38:19,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:38:19,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:19,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103382317] [2025-03-09 00:38:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103382317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105619347] [2025-03-09 00:38:19,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:19,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:19,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:19,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:19,776 INFO L87 Difference]: Start difference. First operand 1416 states and 1904 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03-09 00:38:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:20,299 INFO L93 Difference]: Finished difference Result 1534 states and 2012 transitions. [2025-03-09 00:38:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-03-09 00:38:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:20,303 INFO L225 Difference]: With dead ends: 1534 [2025-03-09 00:38:20,303 INFO L226 Difference]: Without dead ends: 1534 [2025-03-09 00:38:20,303 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-03-09 00:38:20,303 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1177 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:20,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1565 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-09 00:38:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1393. [2025-03-09 00:38:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1126 states have (on average 1.641207815275311) internal successors, (1848), 1386 states have internal predecessors, (1848), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1858 transitions. [2025-03-09 00:38:20,320 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1858 transitions. Word has length 18 [2025-03-09 00:38:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:20,320 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1858 transitions. [2025-03-09 00:38:20,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03-09 00:38:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1858 transitions. [2025-03-09 00:38:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:38:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:20,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:20,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:38:20,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:20,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:20,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185869, now seen corresponding path program 1 times [2025-03-09 00:38:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771001191] [2025-03-09 00:38:20,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:20,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:38:20,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:38:20,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:20,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:20,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771001191] [2025-03-09 00:38:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771001191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:20,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69946913] [2025-03-09 00:38:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:20,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:20,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:20,373 INFO L87 Difference]: Start difference. First operand 1393 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03-09 00:38:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:20,420 INFO L93 Difference]: Finished difference Result 1255 states and 1652 transitions. [2025-03-09 00:38:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-09 00:38:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:20,423 INFO L225 Difference]: With dead ends: 1255 [2025-03-09 00:38:20,423 INFO L226 Difference]: Without dead ends: 1255 [2025-03-09 00:38:20,423 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-03-09 00:38:20,424 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 60 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:20,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1549 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:38:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-09 00:38:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-09 00:38:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1000 states have (on average 1.642) internal successors, (1642), 1248 states have internal predecessors, (1642), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1652 transitions. [2025-03-09 00:38:20,443 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1652 transitions. Word has length 18 [2025-03-09 00:38:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:20,444 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1652 transitions. [2025-03-09 00:38:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03-09 00:38:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1652 transitions. [2025-03-09 00:38:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:38:20,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:20,444 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-03-09 00:38:20,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:38:20,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1518128626, now seen corresponding path program 1 times [2025-03-09 00:38:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962531236] [2025-03-09 00:38:20,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:38:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:38:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:20,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962531236] [2025-03-09 00:38:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962531236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887448991] [2025-03-09 00:38:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:20,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:20,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:20,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:20,496 INFO L87 Difference]: Start difference. First operand 1255 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 4.75) 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-03-09 00:38:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:20,568 INFO L93 Difference]: Finished difference Result 1226 states and 1602 transitions. [2025-03-09 00:38:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) 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-03-09 00:38:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:20,571 INFO L225 Difference]: With dead ends: 1226 [2025-03-09 00:38:20,571 INFO L226 Difference]: Without dead ends: 1226 [2025-03-09 00:38:20,572 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-03-09 00:38:20,573 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 41 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:20,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2270 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-09 00:38:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1220. [2025-03-09 00:38:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.631687242798354) internal successors, (1586), 1213 states have internal predecessors, (1586), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1596 transitions. [2025-03-09 00:38:20,589 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1596 transitions. Word has length 19 [2025-03-09 00:38:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:20,589 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1596 transitions. [2025-03-09 00:38:20,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) 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-03-09 00:38:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1596 transitions. [2025-03-09 00:38:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 00:38:20,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:20,591 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] [2025-03-09 00:38:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:38:20,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:20,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2055582743, now seen corresponding path program 1 times [2025-03-09 00:38:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360718108] [2025-03-09 00:38:20,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:20,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 00:38:20,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:38:20,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:20,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360718108] [2025-03-09 00:38:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360718108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:20,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:20,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778142169] [2025-03-09 00:38:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:20,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:20,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:20,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:20,746 INFO L87 Difference]: Start difference. First operand 1220 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03-09 00:38:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:21,337 INFO L93 Difference]: Finished difference Result 1442 states and 1749 transitions. [2025-03-09 00:38:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-03-09 00:38:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:21,341 INFO L225 Difference]: With dead ends: 1442 [2025-03-09 00:38:21,341 INFO L226 Difference]: Without dead ends: 1442 [2025-03-09 00:38:21,341 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-03-09 00:38:21,341 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 697 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:21,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1547 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:38:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-09 00:38:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1220. [2025-03-09 00:38:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.623456790123457) internal successors, (1578), 1213 states have internal predecessors, (1578), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1588 transitions. [2025-03-09 00:38:21,353 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1588 transitions. Word has length 28 [2025-03-09 00:38:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1588 transitions. [2025-03-09 00:38:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03-09 00:38:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1588 transitions. [2025-03-09 00:38:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 00:38:21,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:21,354 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] [2025-03-09 00:38:21,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:38:21,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash 312594952, now seen corresponding path program 1 times [2025-03-09 00:38:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789408541] [2025-03-09 00:38:21,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:21,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 00:38:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 00:38:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:21,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789408541] [2025-03-09 00:38:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789408541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498644409] [2025-03-09 00:38:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:21,477 INFO L87 Difference]: Start difference. First operand 1220 states and 1588 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:21,985 INFO L93 Difference]: Finished difference Result 1798 states and 2380 transitions. [2025-03-09 00:38:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-09 00:38:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:21,989 INFO L225 Difference]: With dead ends: 1798 [2025-03-09 00:38:21,989 INFO L226 Difference]: Without dead ends: 1798 [2025-03-09 00:38:21,989 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-03-09 00:38:21,989 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 655 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:21,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1809 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-03-09 00:38:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1216. [2025-03-09 00:38:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 972 states have (on average 1.6152263374485596) internal successors, (1570), 1209 states have internal predecessors, (1570), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1580 transitions. [2025-03-09 00:38:22,001 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1580 transitions. Word has length 33 [2025-03-09 00:38:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:22,001 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1580 transitions. [2025-03-09 00:38:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1580 transitions. [2025-03-09 00:38:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:38:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:22,002 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] [2025-03-09 00:38:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:38:22,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1634634434, now seen corresponding path program 1 times [2025-03-09 00:38:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371979128] [2025-03-09 00:38:22,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:22,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:38:22,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:38:22,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:22,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371979128] [2025-03-09 00:38:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371979128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861911346] [2025-03-09 00:38:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:22,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:22,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:22,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:22,066 INFO L87 Difference]: Start difference. First operand 1216 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03-09 00:38:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:22,126 INFO L93 Difference]: Finished difference Result 1198 states and 1550 transitions. [2025-03-09 00:38:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:38:22,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-03-09 00:38:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:22,132 INFO L225 Difference]: With dead ends: 1198 [2025-03-09 00:38:22,132 INFO L226 Difference]: Without dead ends: 1198 [2025-03-09 00:38:22,132 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-03-09 00:38:22,132 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 27 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:22,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2246 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-09 00:38:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-09 00:38:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6142557651991614) internal successors, (1540), 1191 states have internal predecessors, (1540), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1550 transitions. [2025-03-09 00:38:22,142 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1550 transitions. Word has length 60 [2025-03-09 00:38:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:22,142 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1550 transitions. [2025-03-09 00:38:22,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03-09 00:38:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1550 transitions. [2025-03-09 00:38:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 00:38:22,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:22,143 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] [2025-03-09 00:38:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:38:22,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash 30579484, now seen corresponding path program 1 times [2025-03-09 00:38:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:22,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058038035] [2025-03-09 00:38:22,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:22,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 00:38:22,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 00:38:22,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058038035] [2025-03-09 00:38:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058038035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731098540] [2025-03-09 00:38:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:22,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:22,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:22,254 INFO L87 Difference]: Start difference. First operand 1198 states and 1550 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-09 00:38:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:22,327 INFO L93 Difference]: Finished difference Result 1198 states and 1542 transitions. [2025-03-09 00:38:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:38:22,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-03-09 00:38:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:22,331 INFO L225 Difference]: With dead ends: 1198 [2025-03-09 00:38:22,331 INFO L226 Difference]: Without dead ends: 1198 [2025-03-09 00:38:22,332 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-03-09 00:38:22,333 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 21 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:22,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2240 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-09 00:38:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-09 00:38:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6058700209643606) internal successors, (1532), 1191 states have internal predecessors, (1532), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1542 transitions. [2025-03-09 00:38:22,352 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1542 transitions. Word has length 67 [2025-03-09 00:38:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:22,352 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1542 transitions. [2025-03-09 00:38:22,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-03-09 00:38:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1542 transitions. [2025-03-09 00:38:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 00:38:22,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:22,354 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] [2025-03-09 00:38:22,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:38:22,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:22,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -593930742, now seen corresponding path program 1 times [2025-03-09 00:38:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130662860] [2025-03-09 00:38:22,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 00:38:22,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 00:38:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130662860] [2025-03-09 00:38:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130662860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489758166] [2025-03-09 00:38:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:22,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:22,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:22,448 INFO L87 Difference]: Start difference. First operand 1198 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03-09 00:38:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:22,532 INFO L93 Difference]: Finished difference Result 1457 states and 1839 transitions. [2025-03-09 00:38:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-03-09 00:38:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:22,549 INFO L225 Difference]: With dead ends: 1457 [2025-03-09 00:38:22,549 INFO L226 Difference]: Without dead ends: 1457 [2025-03-09 00:38:22,549 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-03-09 00:38:22,551 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 199 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:22,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1503 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-09 00:38:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1444. [2025-03-09 00:38:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1200 states have (on average 1.5208333333333333) internal successors, (1825), 1437 states have internal predecessors, (1825), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1835 transitions. [2025-03-09 00:38:22,566 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1835 transitions. Word has length 68 [2025-03-09 00:38:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:22,566 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1835 transitions. [2025-03-09 00:38:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03-09 00:38:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1835 transitions. [2025-03-09 00:38:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 00:38:22,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:22,567 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] [2025-03-09 00:38:22,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:38:22,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:22,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1205711771, now seen corresponding path program 1 times [2025-03-09 00:38:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171587209] [2025-03-09 00:38:22,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:22,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 00:38:22,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 00:38:22,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:22,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171587209] [2025-03-09 00:38:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171587209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:22,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:22,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:38:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211984800] [2025-03-09 00:38:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:22,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:38:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:22,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:38:22,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:38:22,901 INFO L87 Difference]: Start difference. First operand 1444 states and 1835 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03-09 00:38:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:23,101 INFO L93 Difference]: Finished difference Result 2061 states and 2565 transitions. [2025-03-09 00:38:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 74 [2025-03-09 00:38:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:23,105 INFO L225 Difference]: With dead ends: 2061 [2025-03-09 00:38:23,105 INFO L226 Difference]: Without dead ends: 2058 [2025-03-09 00:38:23,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:38:23,106 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 722 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4602 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:23,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4602 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:38:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-09 00:38:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1347. [2025-03-09 00:38:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1103 states have (on average 1.540344514959202) internal successors, (1699), 1340 states have internal predecessors, (1699), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1709 transitions. [2025-03-09 00:38:23,120 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1709 transitions. Word has length 74 [2025-03-09 00:38:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:23,120 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1709 transitions. [2025-03-09 00:38:23,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03-09 00:38:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1709 transitions. [2025-03-09 00:38:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 00:38:23,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:23,121 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] [2025-03-09 00:38:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:38:23,121 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -935803664, now seen corresponding path program 1 times [2025-03-09 00:38:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538091054] [2025-03-09 00:38:23,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:23,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 00:38:23,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:38:23,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:23,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538091054] [2025-03-09 00:38:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538091054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192835007] [2025-03-09 00:38:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:23,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:38:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:23,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:38:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:38:23,320 INFO L87 Difference]: Start difference. First operand 1347 states and 1709 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-03-09 00:38:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:23,756 INFO L93 Difference]: Finished difference Result 1346 states and 1707 transitions. [2025-03-09 00:38:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-09 00:38:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:23,761 INFO L225 Difference]: With dead ends: 1346 [2025-03-09 00:38:23,761 INFO L226 Difference]: Without dead ends: 1346 [2025-03-09 00:38:23,762 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-03-09 00:38:23,762 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 2 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:23,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2215 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-09 00:38:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2025-03-09 00:38:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1103 states have (on average 1.5385312783318223) internal successors, (1697), 1339 states have internal predecessors, (1697), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1707 transitions. [2025-03-09 00:38:23,779 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1707 transitions. Word has length 83 [2025-03-09 00:38:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:23,779 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1707 transitions. [2025-03-09 00:38:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-03-09 00:38:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1707 transitions. [2025-03-09 00:38:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 00:38:23,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:23,780 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] [2025-03-09 00:38:23,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:38:23,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -935803663, now seen corresponding path program 1 times [2025-03-09 00:38:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455515320] [2025-03-09 00:38:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 00:38:23,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:38:23,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:23,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:24,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455515320] [2025-03-09 00:38:24,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455515320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:24,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471659426] [2025-03-09 00:38:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:24,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:38:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:24,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:38:24,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:38:24,100 INFO L87 Difference]: Start difference. First operand 1346 states and 1707 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-03-09 00:38:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:24,688 INFO L93 Difference]: Finished difference Result 1345 states and 1705 transitions. [2025-03-09 00:38:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-09 00:38:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:24,691 INFO L225 Difference]: With dead ends: 1345 [2025-03-09 00:38:24,691 INFO L226 Difference]: Without dead ends: 1345 [2025-03-09 00:38:24,691 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-03-09 00:38:24,694 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:24,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2141 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-09 00:38:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2025-03-09 00:38:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1101 states have (on average 1.5395095367847411) internal successors, (1695), 1338 states have internal predecessors, (1695), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1705 transitions. [2025-03-09 00:38:24,707 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1705 transitions. Word has length 83 [2025-03-09 00:38:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:24,707 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1705 transitions. [2025-03-09 00:38:24,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-03-09 00:38:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1705 transitions. [2025-03-09 00:38:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:38:24,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:24,708 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] [2025-03-09 00:38:24,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:38:24,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:24,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388205, now seen corresponding path program 1 times [2025-03-09 00:38:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333445287] [2025-03-09 00:38:24,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:24,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:24,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:24,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:24,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:24,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-03-09 00:38:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333445287] [2025-03-09 00:38:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333445287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:38:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107377661] [2025-03-09 00:38:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:38:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:38:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:38:24,884 INFO L87 Difference]: Start difference. First operand 1345 states and 1705 transitions. Second operand has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-03-09 00:38:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:25,466 INFO L93 Difference]: Finished difference Result 1363 states and 1731 transitions. [2025-03-09 00:38:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:38:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-09 00:38:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:25,472 INFO L225 Difference]: With dead ends: 1363 [2025-03-09 00:38:25,472 INFO L226 Difference]: Without dead ends: 1363 [2025-03-09 00:38:25,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:38:25,473 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 6 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:25,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2983 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:38:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-09 00:38:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1354. [2025-03-09 00:38:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5383228133453561) internal successors, (1706), 1345 states have internal predecessors, (1706), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 00:38:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1721 transitions. [2025-03-09 00:38:25,495 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1721 transitions. Word has length 91 [2025-03-09 00:38:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:25,495 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1721 transitions. [2025-03-09 00:38:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-03-09 00:38:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1721 transitions. [2025-03-09 00:38:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:38:25,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:25,496 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] [2025-03-09 00:38:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:38:25,496 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388206, now seen corresponding path program 1 times [2025-03-09 00:38:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315543695] [2025-03-09 00:38:25,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:25,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:25,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:25,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315543695] [2025-03-09 00:38:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315543695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:25,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:25,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:38:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097691332] [2025-03-09 00:38:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:25,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:38:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:25,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:38:25,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:38:25,850 INFO L87 Difference]: Start difference. First operand 1354 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-03-09 00:38:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:26,468 INFO L93 Difference]: Finished difference Result 1354 states and 1719 transitions. [2025-03-09 00:38:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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 91 [2025-03-09 00:38:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:26,471 INFO L225 Difference]: With dead ends: 1354 [2025-03-09 00:38:26,471 INFO L226 Difference]: Without dead ends: 1354 [2025-03-09 00:38:26,471 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-03-09 00:38:26,472 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 1 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:26,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2784 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:38:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-09 00:38:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-09 00:38:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5365193868349865) internal successors, (1704), 1345 states have internal predecessors, (1704), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-09 00:38:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1719 transitions. [2025-03-09 00:38:26,485 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1719 transitions. Word has length 91 [2025-03-09 00:38:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:26,486 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1719 transitions. [2025-03-09 00:38:26,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 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-03-09 00:38:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1719 transitions. [2025-03-09 00:38:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:38:26,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:26,486 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] [2025-03-09 00:38:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:38:26,486 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078027, now seen corresponding path program 1 times [2025-03-09 00:38:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016659627] [2025-03-09 00:38:26,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:38:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:38:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016659627] [2025-03-09 00:38:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016659627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419577556] [2025-03-09 00:38:26,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:26,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:26,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:26,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:38:26,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:38:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:38:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:26,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:38:26,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:27,026 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-03-09 00:38:27,130 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:38:27,130 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-03-09 00:38:27,156 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-03-09 00:38:27,219 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-03-09 00:38:27,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:27,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:38:27,404 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-03-09 00:38:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:27,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419577556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:27,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-09 00:38:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75369742] [2025-03-09 00:38:27,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:27,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:38:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:27,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:38:27,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=315, Unknown=9, NotChecked=0, Total=380 [2025-03-09 00:38:27,479 INFO L87 Difference]: Start difference. First operand 1354 states and 1719 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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-03-09 00:38:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:29,036 INFO L93 Difference]: Finished difference Result 1361 states and 1725 transitions. [2025-03-09 00:38:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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 92 [2025-03-09 00:38:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:29,041 INFO L225 Difference]: With dead ends: 1361 [2025-03-09 00:38:29,041 INFO L226 Difference]: Without dead ends: 1361 [2025-03-09 00:38:29,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=458, Unknown=11, NotChecked=0, Total=552 [2025-03-09 00:38:29,044 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 705 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 3648 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:29,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 5045 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3648 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:38:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-09 00:38:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2025-03-09 00:38:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1113 states have (on average 1.5336927223719676) internal successors, (1707), 1348 states have internal predecessors, (1707), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1719 transitions. [2025-03-09 00:38:29,055 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1719 transitions. Word has length 92 [2025-03-09 00:38:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:29,055 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1719 transitions. [2025-03-09 00:38:29,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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-03-09 00:38:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1719 transitions. [2025-03-09 00:38:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 00:38:29,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:29,056 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] [2025-03-09 00:38:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:29,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 00:38:29,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078026, now seen corresponding path program 1 times [2025-03-09 00:38:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:29,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383292735] [2025-03-09 00:38:29,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:38:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:38:29,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:29,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383292735] [2025-03-09 00:38:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383292735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738667912] [2025-03-09 00:38:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:29,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:29,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:29,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:29,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:38:29,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 00:38:29,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 00:38:29,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:29,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:29,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:38:29,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:29,910 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-03-09 00:38:29,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:29,990 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-03-09 00:38:29,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-09 00:38:30,007 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-03-09 00:38:30,010 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-03-09 00:38:30,060 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-03-09 00:38:30,063 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-03-09 00:38:30,139 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:30,140 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-03-09 00:38:30,146 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-03-09 00:38:30,167 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-03-09 00:38:30,172 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-03-09 00:38:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:30,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:30,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_775 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |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_776) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:38:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738667912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:30,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-09 00:38:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679684254] [2025-03-09 00:38:30,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:38:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:30,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:38:30,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-09 00:38:30,243 INFO L87 Difference]: Start difference. First operand 1358 states and 1719 transitions. Second operand has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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-03-09 00:38:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:32,004 INFO L93 Difference]: Finished difference Result 1360 states and 1723 transitions. [2025-03-09 00:38:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:38:32,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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 92 [2025-03-09 00:38:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:32,007 INFO L225 Difference]: With dead ends: 1360 [2025-03-09 00:38:32,007 INFO L226 Difference]: Without dead ends: 1360 [2025-03-09 00:38:32,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:38:32,007 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 698 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 4258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 4271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:32,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 4379 Invalid, 4271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4258 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:38:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-09 00:38:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2025-03-09 00:38:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1105 states have (on average 1.5348416289592761) internal successors, (1696), 1340 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1706 transitions. [2025-03-09 00:38:32,021 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1706 transitions. Word has length 92 [2025-03-09 00:38:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1706 transitions. [2025-03-09 00:38:32,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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-03-09 00:38:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1706 transitions. [2025-03-09 00:38:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:38:32,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:32,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-09 00:38:32,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:38:32,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 00:38:32,222 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:32,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499956, now seen corresponding path program 1 times [2025-03-09 00:38:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402944513] [2025-03-09 00:38:32,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:32,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402944513] [2025-03-09 00:38:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402944513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:38:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5001451] [2025-03-09 00:38:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:32,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:38:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:32,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:38:32,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:38:32,564 INFO L87 Difference]: Start difference. First operand 1348 states and 1706 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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-03-09 00:38:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:33,478 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-09 00:38:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:38:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2025-03-09 00:38:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:33,480 INFO L225 Difference]: With dead ends: 1367 [2025-03-09 00:38:33,480 INFO L226 Difference]: Without dead ends: 1367 [2025-03-09 00:38:33,480 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-03-09 00:38:33,481 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 716 mSDsluCounter, 3227 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:33,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3699 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:38:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-09 00:38:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1363. [2025-03-09 00:38:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1353 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1725 transitions. [2025-03-09 00:38:33,507 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1725 transitions. Word has length 94 [2025-03-09 00:38:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1725 transitions. [2025-03-09 00:38:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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-03-09 00:38:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1725 transitions. [2025-03-09 00:38:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:38:33,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:33,509 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-03-09 00:38:33,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 00:38:33,509 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499957, now seen corresponding path program 1 times [2025-03-09 00:38:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439486534] [2025-03-09 00:38:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:33,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:33,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:33,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:33,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439486534] [2025-03-09 00:38:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439486534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:38:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440240477] [2025-03-09 00:38:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:38:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:38:33,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:38:33,947 INFO L87 Difference]: Start difference. First operand 1363 states and 1725 transitions. Second operand has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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-03-09 00:38:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:34,879 INFO L93 Difference]: Finished difference Result 1366 states and 1729 transitions. [2025-03-09 00:38:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:38:34,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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 94 [2025-03-09 00:38:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:34,881 INFO L225 Difference]: With dead ends: 1366 [2025-03-09 00:38:34,882 INFO L226 Difference]: Without dead ends: 1366 [2025-03-09 00:38:34,882 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-03-09 00:38:34,882 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 709 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:34,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2443 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-09 00:38:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1363. [2025-03-09 00:38:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5290437890974085) internal successors, (1711), 1353 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2025-03-09 00:38:34,892 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 94 [2025-03-09 00:38:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:34,892 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2025-03-09 00:38:34,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 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-03-09 00:38:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2025-03-09 00:38:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 00:38:34,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:34,893 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] [2025-03-09 00:38:34,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:38:34,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash -990072660, now seen corresponding path program 1 times [2025-03-09 00:38:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707526270] [2025-03-09 00:38:34,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:34,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:38:34,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:38:34,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707526270] [2025-03-09 00:38:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707526270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503497475] [2025-03-09 00:38:35,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:35,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:35,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:35,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:35,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:38:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:38:35,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:38:35,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:35,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:35,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 00:38:35,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:35,426 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-03-09 00:38:35,508 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:38:35,508 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-03-09 00:38:35,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:38:35,587 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-03-09 00:38:35,688 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:35,689 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-03-09 00:38:35,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:35,748 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-03-09 00:38:35,760 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-03-09 00:38:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:35,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:35,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1057 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-09 00:38:35,841 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1057)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:38:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503497475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:35,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-09 00:38:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897218615] [2025-03-09 00:38:35,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:35,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:38:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:35,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:38:35,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2025-03-09 00:38:35,843 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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-03-09 00:38:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:37,730 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2025-03-09 00:38:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:37,730 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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 95 [2025-03-09 00:38:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:37,732 INFO L225 Difference]: With dead ends: 1365 [2025-03-09 00:38:37,732 INFO L226 Difference]: Without dead ends: 1365 [2025-03-09 00:38:37,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=547, Unknown=9, NotChecked=98, Total=756 [2025-03-09 00:38:37,733 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 692 mSDsluCounter, 5970 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 6441 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:37,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 6441 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:38:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-09 00:38:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2025-03-09 00:38:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1119 states have (on average 1.5272564789991063) internal successors, (1709), 1352 states have internal predecessors, (1709), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1721 transitions. [2025-03-09 00:38:37,744 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1721 transitions. Word has length 95 [2025-03-09 00:38:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:37,745 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1721 transitions. [2025-03-09 00:38:37,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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-03-09 00:38:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1721 transitions. [2025-03-09 00:38:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 00:38:37,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:37,746 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] [2025-03-09 00:38:37,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:37,951 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:37,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash -990072659, now seen corresponding path program 1 times [2025-03-09 00:38:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688600600] [2025-03-09 00:38:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:37,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:38:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:38:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688600600] [2025-03-09 00:38:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688600600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936460281] [2025-03-09 00:38:38,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:38,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:38:38,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 00:38:38,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 00:38:38,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:38,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 00:38:38,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:38,623 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-03-09 00:38:38,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:38,737 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-03-09 00:38:38,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-09 00:38:38,751 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-03-09 00:38:38,757 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-03-09 00:38:38,797 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-03-09 00:38:38,800 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-03-09 00:38:38,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:38,871 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-03-09 00:38:38,876 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-03-09 00:38:38,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:38,921 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-03-09 00:38:38,926 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-03-09 00:38:38,937 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-03-09 00:38:38,939 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-03-09 00:38:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:38,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:38,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:38:38,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-09 00:38:39,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1217) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1218))) (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_1217) .cse1 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:38:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936460281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:39,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-09 00:38:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114123052] [2025-03-09 00:38:39,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:39,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:38:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:39,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:38:39,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-09 00:38:39,034 INFO L87 Difference]: Start difference. First operand 1362 states and 1721 transitions. Second operand has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:38:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:40,166 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2025-03-09 00:38:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:38:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-09 00:38:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:40,168 INFO L225 Difference]: With dead ends: 1364 [2025-03-09 00:38:40,168 INFO L226 Difference]: Without dead ends: 1364 [2025-03-09 00:38:40,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-09 00:38:40,169 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 695 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3222 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:40,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3222 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:38:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-09 00:38:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1346. [2025-03-09 00:38:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1105 states have (on average 1.5312217194570135) internal successors, (1692), 1338 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1702 transitions. [2025-03-09 00:38:40,177 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1702 transitions. Word has length 95 [2025-03-09 00:38:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:40,177 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1702 transitions. [2025-03-09 00:38:40,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:38:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1702 transitions. [2025-03-09 00:38:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:38:40,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:40,178 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-03-09 00:38:40,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:38:40,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 00:38:40,378 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891226, now seen corresponding path program 1 times [2025-03-09 00:38:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:40,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983672518] [2025-03-09 00:38:40,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:40,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:40,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:40,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983672518] [2025-03-09 00:38:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983672518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:38:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958874146] [2025-03-09 00:38:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:38:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:40,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:38:40,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:38:40,669 INFO L87 Difference]: Start difference. First operand 1346 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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-03-09 00:38:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:41,800 INFO L93 Difference]: Finished difference Result 1371 states and 1733 transitions. [2025-03-09 00:38:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:38:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-09 00:38:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:41,802 INFO L225 Difference]: With dead ends: 1371 [2025-03-09 00:38:41,802 INFO L226 Difference]: Without dead ends: 1371 [2025-03-09 00:38:41,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:38:41,802 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 714 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:41,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4598 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:38:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-09 00:38:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1367. [2025-03-09 00:38:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5244444444444445) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1727 transitions. [2025-03-09 00:38:41,826 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1727 transitions. Word has length 97 [2025-03-09 00:38:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:41,826 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1727 transitions. [2025-03-09 00:38:41,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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-03-09 00:38:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1727 transitions. [2025-03-09 00:38:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:38:41,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:41,827 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-03-09 00:38:41,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:38:41,827 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:41,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891225, now seen corresponding path program 1 times [2025-03-09 00:38:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647507083] [2025-03-09 00:38:41,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:41,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:41,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:41,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:41,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647507083] [2025-03-09 00:38:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647507083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:42,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:42,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:38:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96132235] [2025-03-09 00:38:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:38:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:42,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:38:42,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:38:42,277 INFO L87 Difference]: Start difference. First operand 1367 states and 1727 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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-03-09 00:38:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:43,653 INFO L93 Difference]: Finished difference Result 1370 states and 1731 transitions. [2025-03-09 00:38:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:38:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-09 00:38:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:43,656 INFO L225 Difference]: With dead ends: 1370 [2025-03-09 00:38:43,656 INFO L226 Difference]: Without dead ends: 1370 [2025-03-09 00:38:43,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:38:43,656 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 709 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 3526 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:43,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 3572 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3526 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:38:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-09 00:38:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1367. [2025-03-09 00:38:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5226666666666666) internal successors, (1713), 1357 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1725 transitions. [2025-03-09 00:38:43,670 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1725 transitions. Word has length 97 [2025-03-09 00:38:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1725 transitions. [2025-03-09 00:38:43,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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-03-09 00:38:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1725 transitions. [2025-03-09 00:38:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:38:43,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:43,671 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] [2025-03-09 00:38:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 00:38:43,672 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337554, now seen corresponding path program 1 times [2025-03-09 00:38:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879504817] [2025-03-09 00:38:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:38:43,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:38:43,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:43,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879504817] [2025-03-09 00:38:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879504817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85835549] [2025-03-09 00:38:44,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:44,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:44,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:44,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:44,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:38:44,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:38:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:38:44,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:44,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:44,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:38:44,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:44,232 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-03-09 00:38:44,321 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:38:44,321 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-03-09 00:38:44,345 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-03-09 00:38:44,402 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-03-09 00:38:44,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:44,490 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-03-09 00:38:44,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:44,540 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-03-09 00:38:44,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:44,588 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-03-09 00:38:44,597 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-03-09 00:38:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:44,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:44,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1523))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:38:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85835549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:48,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-09 00:38:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448062987] [2025-03-09 00:38:48,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:48,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:38:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:48,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:38:48,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=615, Unknown=37, NotChecked=52, Total=812 [2025-03-09 00:38:48,870 INFO L87 Difference]: Start difference. First operand 1367 states and 1725 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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-03-09 00:38:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:50,848 INFO L93 Difference]: Finished difference Result 1369 states and 1729 transitions. [2025-03-09 00:38:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:38:50,848 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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 98 [2025-03-09 00:38:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:50,850 INFO L225 Difference]: With dead ends: 1369 [2025-03-09 00:38:50,851 INFO L226 Difference]: Without dead ends: 1369 [2025-03-09 00:38:50,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=131, Invalid=764, Unknown=39, NotChecked=58, Total=992 [2025-03-09 00:38:50,852 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 689 mSDsluCounter, 5020 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 5490 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:50,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 5490 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3978 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 00:38:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-09 00:38:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2025-03-09 00:38:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1125 states have (on average 1.520888888888889) internal successors, (1711), 1356 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1723 transitions. [2025-03-09 00:38:50,861 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1723 transitions. Word has length 98 [2025-03-09 00:38:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1723 transitions. [2025-03-09 00:38:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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-03-09 00:38:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1723 transitions. [2025-03-09 00:38:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:38:50,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:50,862 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] [2025-03-09 00:38:50,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:38:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:51,067 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337553, now seen corresponding path program 1 times [2025-03-09 00:38:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300623383] [2025-03-09 00:38:51,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:38:51,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:38:51,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:51,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300623383] [2025-03-09 00:38:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300623383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304174540] [2025-03-09 00:38:51,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:51,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:38:51,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:38:51,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:38:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:38:51,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:51,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:38:51,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:51,888 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-03-09 00:38:51,961 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-03-09 00:38:51,966 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:51,966 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-03-09 00:38:51,988 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-03-09 00:38:51,990 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-03-09 00:38:52,049 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-03-09 00:38:52,052 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-03-09 00:38:52,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:52,152 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-03-09 00:38:52,158 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-03-09 00:38:52,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:52,215 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-03-09 00:38:52,220 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-03-09 00:38:52,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:52,278 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-03-09 00:38:52,283 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-03-09 00:38:52,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:38:52,295 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-03-09 00:38:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:52,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:52,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1692 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2025-03-09 00:38:52,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1692 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-03-09 00:38:52,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690) .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-03-09 00:38:52,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1691))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1690) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1690) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-09 00:38:52,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1691))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699) .cse0 v_ArrVal_1690) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699) .cse5 v_ArrVal_1690) (select (select (store .cse6 .cse5 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1692))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-09 00:38:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304174540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:52,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-09 00:38:52,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303020478] [2025-03-09 00:38:52,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:52,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:38:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:52,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:38:52,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-03-09 00:38:52,506 INFO L87 Difference]: Start difference. First operand 1366 states and 1723 transitions. Second operand has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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-03-09 00:38:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:55,504 INFO L93 Difference]: Finished difference Result 1368 states and 1727 transitions. [2025-03-09 00:38:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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 98 [2025-03-09 00:38:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:55,509 INFO L225 Difference]: With dead ends: 1368 [2025-03-09 00:38:55,509 INFO L226 Difference]: Without dead ends: 1368 [2025-03-09 00:38:55,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2025-03-09 00:38:55,510 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 697 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 5694 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 5338 SdHoareTripleChecker+Invalid, 5710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:55,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 5338 Invalid, 5710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5694 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-09 00:38:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-09 00:38:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1344. [2025-03-09 00:38:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1105 states have (on average 1.527601809954751) internal successors, (1688), 1336 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:38:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1698 transitions. [2025-03-09 00:38:55,518 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1698 transitions. Word has length 98 [2025-03-09 00:38:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:55,519 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1698 transitions. [2025-03-09 00:38:55,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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-03-09 00:38:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1698 transitions. [2025-03-09 00:38:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:38:55,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:55,519 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, 1] [2025-03-09 00:38:55,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:38:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:55,725 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:55,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466702, now seen corresponding path program 1 times [2025-03-09 00:38:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55996649] [2025-03-09 00:38:55,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:38:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:38:55,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:55,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55996649] [2025-03-09 00:38:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55996649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 00:38:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255169304] [2025-03-09 00:38:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:38:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:56,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:38:56,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:38:56,269 INFO L87 Difference]: Start difference. First operand 1344 states and 1698 transitions. Second operand has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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-03-09 00:38:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:57,998 INFO L93 Difference]: Finished difference Result 1375 states and 1735 transitions. [2025-03-09 00:38:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:38:57,998 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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 100 [2025-03-09 00:38:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:58,000 INFO L225 Difference]: With dead ends: 1375 [2025-03-09 00:38:58,000 INFO L226 Difference]: Without dead ends: 1375 [2025-03-09 00:38:58,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:38:58,001 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 712 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:58,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3574 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3527 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:38:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-09 00:38:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2025-03-09 00:38:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5181255526083113) internal successors, (1717), 1361 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1729 transitions. [2025-03-09 00:38:58,016 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1729 transitions. Word has length 100 [2025-03-09 00:38:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:58,016 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1729 transitions. [2025-03-09 00:38:58,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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-03-09 00:38:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1729 transitions. [2025-03-09 00:38:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:38:58,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:58,017 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, 1] [2025-03-09 00:38:58,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 00:38:58,017 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:58,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466701, now seen corresponding path program 1 times [2025-03-09 00:38:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:58,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320400879] [2025-03-09 00:38:58,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:58,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:38:58,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:38:58,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320400879] [2025-03-09 00:38:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320400879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:38:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470859719] [2025-03-09 00:38:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:38:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:58,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:38:58,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:38:58,456 INFO L87 Difference]: Start difference. First operand 1371 states and 1729 transitions. Second operand has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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-03-09 00:38:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:59,861 INFO L93 Difference]: Finished difference Result 1374 states and 1733 transitions. [2025-03-09 00:38:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:38:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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 100 [2025-03-09 00:38:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:59,864 INFO L225 Difference]: With dead ends: 1374 [2025-03-09 00:38:59,864 INFO L226 Difference]: Without dead ends: 1374 [2025-03-09 00:38:59,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:38:59,864 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 727 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4149 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2992 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:38:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-09 00:38:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1371. [2025-03-09 00:38:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5163572060123784) internal successors, (1715), 1361 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:38:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1727 transitions. [2025-03-09 00:38:59,876 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1727 transitions. Word has length 100 [2025-03-09 00:38:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1727 transitions. [2025-03-09 00:38:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 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-03-09 00:38:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1727 transitions. [2025-03-09 00:38:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:38:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:59,879 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, 1, 1] [2025-03-09 00:38:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 00:38:59,879 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:38:59,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -646877626, now seen corresponding path program 1 times [2025-03-09 00:38:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:59,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894349797] [2025-03-09 00:38:59,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:59,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:38:59,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:38:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:59,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894349797] [2025-03-09 00:39:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894349797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465082402] [2025-03-09 00:39:00,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:00,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:00,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:00,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:39:00,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:39:00,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:39:00,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:39:00,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:00,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 00:39:00,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:00,719 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-03-09 00:39:00,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:39:00,807 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-03-09 00:39:00,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-09 00:39:00,834 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-03-09 00:39:00,837 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-03-09 00:39:00,907 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-03-09 00:39:00,911 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-03-09 00:39:01,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:01,020 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-03-09 00:39:01,023 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-03-09 00:39:01,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:01,081 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-03-09 00:39:01,086 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-03-09 00:39:01,127 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:01,127 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-03-09 00:39:01,133 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-03-09 00:39:01,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:01,184 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-03-09 00:39:01,189 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-03-09 00:39:01,200 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-03-09 00:39:01,203 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-03-09 00:39:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:01,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:01,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2032) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2033))) (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~mem57#1.base| v_ArrVal_2032) .cse1 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:39:01,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2032) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2033))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2032) .cse2 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:39:01,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2030))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2033))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2031) .cse0 v_ArrVal_2032) .cse1 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2030))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2031) .cse5 v_ArrVal_2032) (select (select (store .cse6 .cse5 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2035))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-09 00:39:01,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2030))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2033))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2031) .cse1 v_ArrVal_2032) .cse2 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2030))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2031) .cse6 v_ArrVal_2032) (select (select (store .cse7 .cse6 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2035))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2025-03-09 00:39:01,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2041))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2030))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2040) .cse0 v_ArrVal_2031) .cse1 v_ArrVal_2032) (select (select (store .cse2 .cse1 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2035))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2041))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2030))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2033))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2040) .cse5 v_ArrVal_2031) .cse6 v_ArrVal_2032) .cse7 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-03-09 00:39:01,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465082402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:01,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:39:01,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-09 00:39:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465384217] [2025-03-09 00:39:01,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:39:01,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:39:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:01,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:39:01,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=636, Unknown=28, NotChecked=280, Total=1056 [2025-03-09 00:39:01,483 INFO L87 Difference]: Start difference. First operand 1371 states and 1727 transitions. Second operand has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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-03-09 00:39:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:04,429 INFO L93 Difference]: Finished difference Result 1373 states and 1731 transitions. [2025-03-09 00:39:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:39:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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 101 [2025-03-09 00:39:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:04,432 INFO L225 Difference]: With dead ends: 1373 [2025-03-09 00:39:04,432 INFO L226 Difference]: Without dead ends: 1373 [2025-03-09 00:39:04,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=997, Unknown=31, NotChecked=350, Total=1560 [2025-03-09 00:39:04,433 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 695 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 5996 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:04,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 5775 Invalid, 6012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5996 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-09 00:39:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-09 00:39:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1370. [2025-03-09 00:39:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1131 states have (on average 1.5145888594164456) internal successors, (1713), 1360 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:39:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1725 transitions. [2025-03-09 00:39:04,442 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1725 transitions. Word has length 101 [2025-03-09 00:39:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:04,442 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1725 transitions. [2025-03-09 00:39:04,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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-03-09 00:39:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1725 transitions. [2025-03-09 00:39:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:39:04,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:04,443 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, 1, 1] [2025-03-09 00:39:04,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:39:04,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:04,644 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:39:04,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash -646877627, now seen corresponding path program 1 times [2025-03-09 00:39:04,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:04,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517109606] [2025-03-09 00:39:04,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:39:04,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:39:04,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:04,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517109606] [2025-03-09 00:39:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517109606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472267533] [2025-03-09 00:39:05,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:05,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:05,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:39:05,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:39:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:39:05,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:39:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:05,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 00:39:05,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:05,286 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-03-09 00:39:05,359 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:39:05,359 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-03-09 00:39:05,383 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-03-09 00:39:05,458 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-03-09 00:39:05,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:05,571 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-03-09 00:39:05,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:05,641 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-03-09 00:39:05,683 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:05,684 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-03-09 00:39:05,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:05,736 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-03-09 00:39:05,749 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-03-09 00:39:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:05,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:05,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2215))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2025-03-09 00:39:05,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2214))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2215)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:39:05,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2215)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:39:05,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2215)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:39:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472267533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:05,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:39:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-09 00:39:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713446917] [2025-03-09 00:39:05,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:39:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 00:39:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:05,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 00:39:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=661, Unknown=39, NotChecked=228, Total=1056 [2025-03-09 00:39:05,912 INFO L87 Difference]: Start difference. First operand 1370 states and 1725 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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-03-09 00:39:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:08,047 INFO L93 Difference]: Finished difference Result 1372 states and 1729 transitions. [2025-03-09 00:39:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:39:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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 101 [2025-03-09 00:39:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:08,050 INFO L225 Difference]: With dead ends: 1372 [2025-03-09 00:39:08,054 INFO L226 Difference]: Without dead ends: 1372 [2025-03-09 00:39:08,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=817, Unknown=40, NotChecked=252, Total=1260 [2025-03-09 00:39:08,055 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 681 mSDsluCounter, 5467 mSDsCounter, 0 mSdLazyCounter, 4289 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 5936 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:08,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 5936 Invalid, 4304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4289 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:39:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-09 00:39:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1342. [2025-03-09 00:39:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1105 states have (on average 1.5239819004524886) internal successors, (1684), 1334 states have internal predecessors, (1684), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:39:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1694 transitions. [2025-03-09 00:39:08,067 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1694 transitions. Word has length 101 [2025-03-09 00:39:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1694 transitions. [2025-03-09 00:39:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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-03-09 00:39:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1694 transitions. [2025-03-09 00:39:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:39:08,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:08,067 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, 1, 1, 1, 1, 1] [2025-03-09 00:39:08,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 00:39:08,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-09 00:39:08,268 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:39:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 164657031, now seen corresponding path program 1 times [2025-03-09 00:39:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132905450] [2025-03-09 00:39:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:08,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:39:08,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:39:08,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:08,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132905450] [2025-03-09 00:39:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132905450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:39:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085988685] [2025-03-09 00:39:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:39:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:08,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:39:08,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:39:08,821 INFO L87 Difference]: Start difference. First operand 1342 states and 1694 transitions. Second operand has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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-03-09 00:39:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:10,240 INFO L93 Difference]: Finished difference Result 1381 states and 1739 transitions. [2025-03-09 00:39:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:39:10,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2025-03-09 00:39:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:10,242 INFO L225 Difference]: With dead ends: 1381 [2025-03-09 00:39:10,242 INFO L226 Difference]: Without dead ends: 1381 [2025-03-09 00:39:10,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:39:10,242 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 714 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:10,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4571 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:39:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-09 00:39:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-09 00:39:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5109745390693592) internal successors, (1721), 1367 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:39:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1733 transitions. [2025-03-09 00:39:10,252 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1733 transitions. Word has length 104 [2025-03-09 00:39:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1733 transitions. [2025-03-09 00:39:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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-03-09 00:39:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1733 transitions. [2025-03-09 00:39:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:39:10,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:10,253 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, 1, 1, 1, 1, 1] [2025-03-09 00:39:10,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 00:39:10,253 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:39:10,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 164657032, now seen corresponding path program 1 times [2025-03-09 00:39:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645842342] [2025-03-09 00:39:10,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:10,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:39:10,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:39:10,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:10,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645842342] [2025-03-09 00:39:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645842342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:10,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 00:39:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108774678] [2025-03-09 00:39:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:39:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:10,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:39:10,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:39:10,984 INFO L87 Difference]: Start difference. First operand 1377 states and 1733 transitions. Second operand has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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-03-09 00:39:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:12,915 INFO L93 Difference]: Finished difference Result 1380 states and 1737 transitions. [2025-03-09 00:39:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:39:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2025-03-09 00:39:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:12,917 INFO L225 Difference]: With dead ends: 1380 [2025-03-09 00:39:12,917 INFO L226 Difference]: Without dead ends: 1380 [2025-03-09 00:39:12,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:39:12,918 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 711 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:12,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 3911 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:39:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-09 00:39:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-03-09 00:39:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5092186128182616) internal successors, (1719), 1367 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:39:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1731 transitions. [2025-03-09 00:39:12,928 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1731 transitions. Word has length 104 [2025-03-09 00:39:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:12,929 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1731 transitions. [2025-03-09 00:39:12,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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-03-09 00:39:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1731 transitions. [2025-03-09 00:39:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:39:12,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:12,929 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, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 00:39:12,930 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:39:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash -865823809, now seen corresponding path program 1 times [2025-03-09 00:39:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514802974] [2025-03-09 00:39:12,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:39:12,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:39:12,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:12,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514802974] [2025-03-09 00:39:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514802974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364201406] [2025-03-09 00:39:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:13,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:13,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:39:13,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:39:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:39:13,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:39:13,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:13,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:13,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 00:39:13,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:13,730 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-03-09 00:39:13,831 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:39:13,832 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-03-09 00:39:13,862 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-03-09 00:39:13,925 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-03-09 00:39:14,032 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:14,033 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-03-09 00:39:14,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:14,092 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-03-09 00:39:14,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:14,136 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-03-09 00:39:14,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:14,176 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-03-09 00:39:14,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:14,218 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-03-09 00:39:14,228 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-03-09 00:39:14,277 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-09 00:39:14,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-09 00:39:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:14,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364201406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:14,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:39:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2025-03-09 00:39:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283877940] [2025-03-09 00:39:14,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:39:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 00:39:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:14,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 00:39:14,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1163, Unknown=54, NotChecked=0, Total=1406 [2025-03-09 00:39:14,848 INFO L87 Difference]: Start difference. First operand 1377 states and 1731 transitions. Second operand has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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-03-09 00:39:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:17,161 INFO L93 Difference]: Finished difference Result 1379 states and 1735 transitions. [2025-03-09 00:39:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:39:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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 105 [2025-03-09 00:39:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:17,164 INFO L225 Difference]: With dead ends: 1379 [2025-03-09 00:39:17,164 INFO L226 Difference]: Without dead ends: 1379 [2025-03-09 00:39:17,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=1371, Unknown=54, NotChecked=0, Total=1640 [2025-03-09 00:39:17,164 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 677 mSDsluCounter, 5914 mSDsCounter, 0 mSdLazyCounter, 4666 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 6382 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:17,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 6382 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4666 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-09 00:39:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-03-09 00:39:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2025-03-09 00:39:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1139 states have (on average 1.507462686567164) internal successors, (1717), 1366 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 00:39:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1729 transitions. [2025-03-09 00:39:17,173 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1729 transitions. Word has length 105 [2025-03-09 00:39:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:17,174 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1729 transitions. [2025-03-09 00:39:17,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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-03-09 00:39:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1729 transitions. [2025-03-09 00:39:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:39:17,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:17,174 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, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:17,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:39:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-09 00:39:17,375 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-09 00:39:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -865823808, now seen corresponding path program 1 times [2025-03-09 00:39:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170235744] [2025-03-09 00:39:17,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:17,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:39:17,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:39:17,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:17,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170235744] [2025-03-09 00:39:18,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170235744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663903610] [2025-03-09 00:39:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:18,153 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:39:18,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:39:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:39:18,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:39:18,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:18,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:18,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 00:39:18,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:18,359 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-03-09 00:39:18,445 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-03-09 00:39:18,458 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:39:18,458 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-03-09 00:39:18,496 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-03-09 00:39:18,500 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-03-09 00:39:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-09 00:39:18,601 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-03-09 00:39:18,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:18,739 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 73 treesize of output 66 [2025-03-09 00:39:18,748 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-03-09 00:39:18,855 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:18,856 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 73 treesize of output 66 [2025-03-09 00:39:18,863 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-03-09 00:39:18,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:18,939 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 73 treesize of output 66 [2025-03-09 00:39:18,946 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-03-09 00:39:19,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:19,005 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 73 treesize of output 66 [2025-03-09 00:39:19,009 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-03-09 00:39:19,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:19,070 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 73 treesize of output 66 [2025-03-09 00:39:19,073 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-03-09 00:39:19,090 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 42 treesize of output 18 [2025-03-09 00:39:19,095 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-03-09 00:39:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:39:19,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 00:39:19,156 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 00:39:19,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-09 00:39:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:19,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663903610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:36,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:39:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-09 00:39:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845413489] [2025-03-09 00:39:36,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:39:36,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 00:39:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:36,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 00:39:36,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1471, Unknown=68, NotChecked=0, Total=1722 [2025-03-09 00:39:36,650 INFO L87 Difference]: Start difference. First operand 1376 states and 1729 transitions. Second operand has 30 states, 27 states have (on average 6.296296296296297) internal successors, (170), 29 states have internal predecessors, (170), 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)