./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_OAT_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-?-798a7b3-m [2025-03-04 09:29:18,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:29:18,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:29:18,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:29:18,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:29:18,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:29:18,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:29:18,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:29:18,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:29:18,516 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:29:18,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:29:18,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:29:18,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:29:18,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:29:18,517 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:29:18,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:29:18,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:29:18,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:29:18,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:29:18,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:29:18,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:29:18,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:29:18,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:29:18,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:29:18,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:29:18,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:29:18,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:29:18,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:29:18,521 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-04 09:29:18,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:29:18,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:29:18,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:29:18,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:29:18,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:29:18,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-03-04 09:29:20,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4115f6fb/6bcba20112d5449d9599e63f4cac73db/FLAG6949a3eb5 [2025-03-04 09:29:20,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:29:20,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-03-04 09:29:20,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4115f6fb/6bcba20112d5449d9599e63f4cac73db/FLAG6949a3eb5 [2025-03-04 09:29:20,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4115f6fb/6bcba20112d5449d9599e63f4cac73db [2025-03-04 09:29:20,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:29:20,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:29:20,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:29:20,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:29:20,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:29:20,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709691d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20, skipping insertion in model container [2025-03-04 09:29:20,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:29:20,631 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-04 09:29:20,654 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-04 09:29:20,656 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-04 09:29:20,658 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-04 09:29:20,662 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-04 09:29:20,685 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-04 09:29:20,685 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-04 09:29:20,687 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-04 09:29:20,687 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-04 09:29:20,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:29:20,702 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:29:20,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:29:20,818 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:29:20,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20 WrapperNode [2025-03-04 09:29:20,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:29:20,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:29:20,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:29:20,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:29:20,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,881 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-03-04 09:29:20,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:29:20,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:29:20,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:29:20,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:29:20,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,944 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-04 09:29:20,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:20,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:21,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:29:21,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:29:21,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:29:21,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:29:21,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (1/1) ... [2025-03-04 09:29:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:29:21,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:21,044 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-04 09:29:21,048 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-04 09:29:21,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:29:21,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:29:21,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:29:21,063 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:29:21,063 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:29:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:29:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:29:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:29:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:29:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:29:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:29:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:29:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:29:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:29:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:29:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:29:21,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:29:21,230 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:29:22,638 INFO L1325 $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-04 09:29:22,714 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-03-04 09:29:22,714 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:29:22,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:29:22,770 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:29:22,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:29:22 BoogieIcfgContainer [2025-03-04 09:29:22,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:29:22,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:29:22,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:29:22,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:29:22,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:29:20" (1/3) ... [2025-03-04 09:29:22,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71e8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:29:22, skipping insertion in model container [2025-03-04 09:29:22,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:29:20" (2/3) ... [2025-03-04 09:29:22,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71e8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:29:22, skipping insertion in model container [2025-03-04 09:29:22,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:29:22" (3/3) ... [2025-03-04 09:29:22,779 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2025-03-04 09:29:22,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:29:22,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-1.i that has 4 procedures, 1058 locations, 1 initial locations, 31 loop locations, and 420 error locations. [2025-03-04 09:29:22,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:29:22,843 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;@452b7474, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:29:22,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-03-04 09:29:22,852 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-04 09:29:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:29:22,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:22,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:29:22,856 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-04 09:29:22,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 41525260, now seen corresponding path program 1 times [2025-03-04 09:29:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615565931] [2025-03-04 09:29:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:22,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:29:22,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:29:22,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:22,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:23,049 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-04 09:29:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615565931] [2025-03-04 09:29:23,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615565931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:23,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247622804] [2025-03-04 09:29:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:23,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:23,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:23,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:23,079 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-04 09:29:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:23,992 INFO L93 Difference]: Finished difference Result 1342 states and 1595 transitions. [2025-03-04 09:29:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:23,994 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-04 09:29:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:24,004 INFO L225 Difference]: With dead ends: 1342 [2025-03-04 09:29:24,004 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 09:29:24,005 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-04 09:29:24,011 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-04 09:29:24,011 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-04 09:29:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 09:29:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1253. [2025-03-04 09:29:24,074 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-04 09:29:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1587 transitions. [2025-03-04 09:29:24,082 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1587 transitions. Word has length 4 [2025-03-04 09:29:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:24,082 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1587 transitions. [2025-03-04 09:29:24,082 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-04 09:29:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1587 transitions. [2025-03-04 09:29:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:29:24,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:24,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:29:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:29:24,083 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-04 09:29:24,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash 41526588, now seen corresponding path program 1 times [2025-03-04 09:29:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212816212] [2025-03-04 09:29:24,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:29:24,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:29:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:24,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:24,153 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-04 09:29:24,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212816212] [2025-03-04 09:29:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212816212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:29:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788906743] [2025-03-04 09:29:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:24,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:24,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:24,155 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-04 09:29:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:24,619 INFO L93 Difference]: Finished difference Result 1250 states and 1579 transitions. [2025-03-04 09:29:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:24,619 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-04 09:29:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:24,624 INFO L225 Difference]: With dead ends: 1250 [2025-03-04 09:29:24,624 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 09:29:24,624 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-04 09:29:24,625 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1081 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-04 09:29:24,626 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-04 09:29:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 09:29:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-04 09:29:24,652 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-04 09:29:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1579 transitions. [2025-03-04 09:29:24,658 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1579 transitions. Word has length 4 [2025-03-04 09:29:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:24,659 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1579 transitions. [2025-03-04 09:29:24,660 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-04 09:29:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1579 transitions. [2025-03-04 09:29:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:29:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:24,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:29:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:29:24,660 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-04 09:29:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 41526589, now seen corresponding path program 1 times [2025-03-04 09:29:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225642817] [2025-03-04 09:29:24,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:24,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:29:24,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:29:24,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:24,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:24,723 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-04 09:29:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225642817] [2025-03-04 09:29:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225642817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:24,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:24,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:29:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390491043] [2025-03-04 09:29:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:24,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:24,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:24,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:24,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:24,724 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-04 09:29:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:25,451 INFO L93 Difference]: Finished difference Result 2005 states and 2479 transitions. [2025-03-04 09:29:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:25,452 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-04 09:29:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:25,460 INFO L225 Difference]: With dead ends: 2005 [2025-03-04 09:29:25,460 INFO L226 Difference]: Without dead ends: 2005 [2025-03-04 09:29:25,460 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-04 09:29:25,461 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-04 09:29:25,462 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-04 09:29:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-03-04 09:29:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1743. [2025-03-04 09:29:25,490 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-04 09:29:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2468 transitions. [2025-03-04 09:29:25,497 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2468 transitions. Word has length 4 [2025-03-04 09:29:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2468 transitions. [2025-03-04 09:29:25,497 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-04 09:29:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2468 transitions. [2025-03-04 09:29:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:29:25,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:25,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:29:25,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:29:25,498 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-04 09:29:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash -539402885, now seen corresponding path program 1 times [2025-03-04 09:29:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667733436] [2025-03-04 09:29:25,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:25,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:29:25,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:29:25,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:25,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:25,564 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-04 09:29:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:25,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667733436] [2025-03-04 09:29:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667733436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:25,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:29:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230462542] [2025-03-04 09:29:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:25,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:25,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:25,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:25,566 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-04 09:29:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:26,106 INFO L93 Difference]: Finished difference Result 1781 states and 2399 transitions. [2025-03-04 09:29:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:26,107 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-04 09:29:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:26,111 INFO L225 Difference]: With dead ends: 1781 [2025-03-04 09:29:26,111 INFO L226 Difference]: Without dead ends: 1781 [2025-03-04 09:29:26,112 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-04 09:29:26,112 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-04 09:29:26,112 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-04 09:29:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-04 09:29:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1696. [2025-03-04 09:29:26,131 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-04 09:29:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2397 transitions. [2025-03-04 09:29:26,136 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2397 transitions. Word has length 9 [2025-03-04 09:29:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:26,136 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2397 transitions. [2025-03-04 09:29:26,136 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-04 09:29:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2397 transitions. [2025-03-04 09:29:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:29:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:26,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:29:26,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:29:26,137 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-04 09:29:26,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -539402884, now seen corresponding path program 1 times [2025-03-04 09:29:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64860008] [2025-03-04 09:29:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:26,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:29:26,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:29:26,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:26,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:26,228 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-04 09:29:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64860008] [2025-03-04 09:29:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64860008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:29:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454108611] [2025-03-04 09:29:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:26,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:26,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:26,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:26,230 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-04 09:29:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:26,759 INFO L93 Difference]: Finished difference Result 1987 states and 2739 transitions. [2025-03-04 09:29:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:26,759 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-04 09:29:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:26,764 INFO L225 Difference]: With dead ends: 1987 [2025-03-04 09:29:26,764 INFO L226 Difference]: Without dead ends: 1987 [2025-03-04 09:29:26,764 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-04 09:29:26,765 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:26,765 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.5s Time] [2025-03-04 09:29:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-04 09:29:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1671. [2025-03-04 09:29:26,784 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-04 09:29:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2348 transitions. [2025-03-04 09:29:26,787 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2348 transitions. Word has length 9 [2025-03-04 09:29:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:26,787 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2348 transitions. [2025-03-04 09:29:26,787 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-04 09:29:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2348 transitions. [2025-03-04 09:29:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:29:26,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:26,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:29:26,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:29:26,788 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-04 09:29:26,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546303, now seen corresponding path program 1 times [2025-03-04 09:29:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:26,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691351909] [2025-03-04 09:29:26,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:26,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:29:26,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:29:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:26,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:26,842 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-04 09:29:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691351909] [2025-03-04 09:29:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691351909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252438282] [2025-03-04 09:29:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:26,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:26,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:26,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:26,843 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-04 09:29:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:27,349 INFO L93 Difference]: Finished difference Result 1795 states and 2507 transitions. [2025-03-04 09:29:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:27,349 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-04 09:29:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:27,354 INFO L225 Difference]: With dead ends: 1795 [2025-03-04 09:29:27,355 INFO L226 Difference]: Without dead ends: 1795 [2025-03-04 09:29:27,355 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-04 09:29:27,355 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1281 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:27,356 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.5s Time] [2025-03-04 09:29:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-04 09:29:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1648. [2025-03-04 09:29:27,375 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-04 09:29:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2279 transitions. [2025-03-04 09:29:27,378 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2279 transitions. Word has length 13 [2025-03-04 09:29:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2279 transitions. [2025-03-04 09:29:27,378 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-04 09:29:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2279 transitions. [2025-03-04 09:29:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:29:27,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:27,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:29:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:29:27,379 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-04 09:29:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546304, now seen corresponding path program 1 times [2025-03-04 09:29:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865404735] [2025-03-04 09:29:27,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:29:27,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:29:27,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:27,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:27,447 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-04 09:29:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865404735] [2025-03-04 09:29:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865404735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:27,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578658047] [2025-03-04 09:29:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:27,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:27,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:27,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:27,448 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-04 09:29:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:27,507 INFO L93 Difference]: Finished difference Result 1447 states and 1970 transitions. [2025-03-04 09:29:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:27,508 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-04 09:29:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:27,511 INFO L225 Difference]: With dead ends: 1447 [2025-03-04 09:29:27,512 INFO L226 Difference]: Without dead ends: 1447 [2025-03-04 09:29:27,512 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-04 09:29:27,512 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:27,512 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.1s Time] [2025-03-04 09:29:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-04 09:29:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-04 09:29:27,530 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-04 09:29:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1970 transitions. [2025-03-04 09:29:27,535 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1970 transitions. Word has length 13 [2025-03-04 09:29:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:27,536 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1970 transitions. [2025-03-04 09:29:27,536 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-04 09:29:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1970 transitions. [2025-03-04 09:29:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:29:27,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:27,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:29:27,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:29:27,537 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-04 09:29:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 966072339, now seen corresponding path program 1 times [2025-03-04 09:29:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733058291] [2025-03-04 09:29:27,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:27,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:29:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:29:27,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:27,587 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-04 09:29:27,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733058291] [2025-03-04 09:29:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733058291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:27,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641269292] [2025-03-04 09:29:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:27,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:27,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:27,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:27,589 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-04 09:29:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:27,683 INFO L93 Difference]: Finished difference Result 1416 states and 1904 transitions. [2025-03-04 09:29:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:29:27,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-04 09:29:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:27,687 INFO L225 Difference]: With dead ends: 1416 [2025-03-04 09:29:27,687 INFO L226 Difference]: Without dead ends: 1416 [2025-03-04 09:29:27,687 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-04 09:29:27,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-04 09:29:27,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-04 09:29:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-04 09:29:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2025-03-04 09:29:27,721 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-04 09:29:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2025-03-04 09:29:27,723 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 14 [2025-03-04 09:29:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:27,723 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2025-03-04 09:29:27,724 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-04 09:29:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2025-03-04 09:29:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:29:27,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:27,724 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-04 09:29:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:29:27,724 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-04 09:29:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185868, now seen corresponding path program 1 times [2025-03-04 09:29:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017951294] [2025-03-04 09:29:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:27,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:29:27,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:29:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:27,785 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-04 09:29:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017951294] [2025-03-04 09:29:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017951294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:27,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:27,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:27,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799738558] [2025-03-04 09:29:27,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:27,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:27,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:27,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:27,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:27,786 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-04 09:29:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:28,283 INFO L93 Difference]: Finished difference Result 1534 states and 2012 transitions. [2025-03-04 09:29:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:28,284 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-04 09:29:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:28,287 INFO L225 Difference]: With dead ends: 1534 [2025-03-04 09:29:28,287 INFO L226 Difference]: Without dead ends: 1534 [2025-03-04 09:29:28,287 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-04 09:29:28,288 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-04 09:29:28,288 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-04 09:29:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-04 09:29:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1393. [2025-03-04 09:29:28,301 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-04 09:29:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1858 transitions. [2025-03-04 09:29:28,303 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1858 transitions. Word has length 18 [2025-03-04 09:29:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:28,303 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1858 transitions. [2025-03-04 09:29:28,304 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-04 09:29:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1858 transitions. [2025-03-04 09:29:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:29:28,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:28,304 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-04 09:29:28,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:29:28,304 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-04 09:29:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185869, now seen corresponding path program 1 times [2025-03-04 09:29:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138782962] [2025-03-04 09:29:28,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:28,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:29:28,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:29:28,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:28,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:28,369 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-04 09:29:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138782962] [2025-03-04 09:29:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138782962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553704297] [2025-03-04 09:29:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:28,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:28,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:28,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:28,370 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-04 09:29:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:28,421 INFO L93 Difference]: Finished difference Result 1255 states and 1652 transitions. [2025-03-04 09:29:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:28,421 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-04 09:29:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:28,424 INFO L225 Difference]: With dead ends: 1255 [2025-03-04 09:29:28,424 INFO L226 Difference]: Without dead ends: 1255 [2025-03-04 09:29:28,424 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-04 09:29:28,425 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-04 09:29:28,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-04 09:29:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-04 09:29:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-04 09:29:28,440 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-04 09:29:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1652 transitions. [2025-03-04 09:29:28,444 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1652 transitions. Word has length 18 [2025-03-04 09:29:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:28,445 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1652 transitions. [2025-03-04 09:29:28,445 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-04 09:29:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1652 transitions. [2025-03-04 09:29:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:29:28,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:28,445 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-04 09:29:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:29:28,445 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-04 09:29:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1518128626, now seen corresponding path program 1 times [2025-03-04 09:29:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649803709] [2025-03-04 09:29:28,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:29:28,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:29:28,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:28,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:28,511 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-04 09:29:28,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:28,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649803709] [2025-03-04 09:29:28,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649803709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:28,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:28,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835840600] [2025-03-04 09:29:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:28,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:28,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:28,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:28,512 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-04 09:29:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:28,592 INFO L93 Difference]: Finished difference Result 1226 states and 1602 transitions. [2025-03-04 09:29:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:28,592 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-04 09:29:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:28,595 INFO L225 Difference]: With dead ends: 1226 [2025-03-04 09:29:28,595 INFO L226 Difference]: Without dead ends: 1226 [2025-03-04 09:29:28,595 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-04 09:29:28,596 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 41 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 09:29:28,596 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-04 09:29:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-04 09:29:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1220. [2025-03-04 09:29:28,611 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-04 09:29:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1596 transitions. [2025-03-04 09:29:28,613 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1596 transitions. Word has length 19 [2025-03-04 09:29:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:28,613 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1596 transitions. [2025-03-04 09:29:28,613 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-04 09:29:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1596 transitions. [2025-03-04 09:29:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 09:29:28,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:28,614 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-04 09:29:28,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:29:28,614 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-04 09:29:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2055582743, now seen corresponding path program 1 times [2025-03-04 09:29:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68775428] [2025-03-04 09:29:28,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:28,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:29:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:29:28,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:28,726 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-04 09:29:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68775428] [2025-03-04 09:29:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68775428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652639535] [2025-03-04 09:29:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:28,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:28,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:28,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:28,727 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-04 09:29:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:29,331 INFO L93 Difference]: Finished difference Result 1442 states and 1749 transitions. [2025-03-04 09:29:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:29,331 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-04 09:29:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:29,336 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 09:29:29,336 INFO L226 Difference]: Without dead ends: 1442 [2025-03-04 09:29:29,336 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-04 09:29:29,336 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-04 09:29:29,336 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-04 09:29:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-04 09:29:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1220. [2025-03-04 09:29:29,347 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-04 09:29:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1588 transitions. [2025-03-04 09:29:29,349 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1588 transitions. Word has length 28 [2025-03-04 09:29:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:29,349 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1588 transitions. [2025-03-04 09:29:29,349 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-04 09:29:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1588 transitions. [2025-03-04 09:29:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 09:29:29,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:29,350 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-04 09:29:29,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:29:29,350 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-04 09:29:29,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 312594952, now seen corresponding path program 1 times [2025-03-04 09:29:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386481790] [2025-03-04 09:29:29,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:29,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:29:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:29:29,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:29,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:29,444 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-04 09:29:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386481790] [2025-03-04 09:29:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386481790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036396938] [2025-03-04 09:29:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:29,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:29,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:29,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:29,445 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-04 09:29:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:29,940 INFO L93 Difference]: Finished difference Result 1798 states and 2380 transitions. [2025-03-04 09:29:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:29:29,940 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-04 09:29:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:29,944 INFO L225 Difference]: With dead ends: 1798 [2025-03-04 09:29:29,944 INFO L226 Difference]: Without dead ends: 1798 [2025-03-04 09:29:29,944 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-04 09:29:29,945 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-04 09:29:29,945 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-04 09:29:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-03-04 09:29:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1216. [2025-03-04 09:29:29,968 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-04 09:29:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1580 transitions. [2025-03-04 09:29:29,969 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1580 transitions. Word has length 33 [2025-03-04 09:29:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:29,969 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1580 transitions. [2025-03-04 09:29:29,969 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-04 09:29:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1580 transitions. [2025-03-04 09:29:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 09:29:29,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:29,973 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-04 09:29:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:29:29,974 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-04 09:29:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1634634434, now seen corresponding path program 1 times [2025-03-04 09:29:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533992847] [2025-03-04 09:29:29,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:29,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 09:29:29,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 09:29:29,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:30,042 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-04 09:29:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:30,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533992847] [2025-03-04 09:29:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533992847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852866304] [2025-03-04 09:29:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:30,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:30,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:30,043 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-04 09:29:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:30,109 INFO L93 Difference]: Finished difference Result 1198 states and 1550 transitions. [2025-03-04 09:29:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:29:30,110 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-04 09:29:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:30,112 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:29:30,112 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:29:30,112 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-04 09:29:30,113 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-04 09:29:30,113 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-04 09:29:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:29:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:29:30,123 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-04 09:29:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1550 transitions. [2025-03-04 09:29:30,125 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1550 transitions. Word has length 60 [2025-03-04 09:29:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:30,125 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1550 transitions. [2025-03-04 09:29:30,125 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-04 09:29:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1550 transitions. [2025-03-04 09:29:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 09:29:30,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:30,125 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-04 09:29:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:29:30,125 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-04 09:29:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash 30579484, now seen corresponding path program 1 times [2025-03-04 09:29:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:30,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228972193] [2025-03-04 09:29:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:30,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 09:29:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 09:29:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:30,213 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-04 09:29:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:30,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228972193] [2025-03-04 09:29:30,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228972193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:30,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:30,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244233604] [2025-03-04 09:29:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:29:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:30,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:29:30,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:29:30,214 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-04 09:29:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:30,297 INFO L93 Difference]: Finished difference Result 1198 states and 1542 transitions. [2025-03-04 09:29:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:29:30,297 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-04 09:29:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:30,301 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:29:30,301 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:29:30,301 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-04 09:29:30,302 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 21 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 09:29:30,302 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-04 09:29:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:29:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:29:30,315 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-04 09:29:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1542 transitions. [2025-03-04 09:29:30,316 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1542 transitions. Word has length 67 [2025-03-04 09:29:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:30,317 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1542 transitions. [2025-03-04 09:29:30,317 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-04 09:29:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1542 transitions. [2025-03-04 09:29:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 09:29:30,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:30,318 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-04 09:29:30,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:29:30,318 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-04 09:29:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -593930742, now seen corresponding path program 1 times [2025-03-04 09:29:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580809162] [2025-03-04 09:29:30,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:30,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 09:29:30,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 09:29:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:30,395 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-04 09:29:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580809162] [2025-03-04 09:29:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580809162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:29:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456539600] [2025-03-04 09:29:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:30,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:29:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:30,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:29:30,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:29:30,397 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-04 09:29:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:30,496 INFO L93 Difference]: Finished difference Result 1457 states and 1839 transitions. [2025-03-04 09:29:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:29:30,496 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-04 09:29:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:30,499 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 09:29:30,500 INFO L226 Difference]: Without dead ends: 1457 [2025-03-04 09:29:30,500 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-04 09:29:30,500 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-04 09:29:30,500 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-04 09:29:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-04 09:29:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1444. [2025-03-04 09:29:30,511 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-04 09:29:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1835 transitions. [2025-03-04 09:29:30,514 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1835 transitions. Word has length 68 [2025-03-04 09:29:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:30,514 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1835 transitions. [2025-03-04 09:29:30,515 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-04 09:29:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1835 transitions. [2025-03-04 09:29:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:29:30,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:30,516 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-04 09:29:30,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:29:30,516 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-04 09:29:30,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1205711771, now seen corresponding path program 1 times [2025-03-04 09:29:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:30,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214515122] [2025-03-04 09:29:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:30,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:29:30,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:29:30,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:30,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:30,807 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-04 09:29:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214515122] [2025-03-04 09:29:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214515122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:29:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555745050] [2025-03-04 09:29:30,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:30,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:29:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:30,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:29:30,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:29:30,810 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-04 09:29:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:31,004 INFO L93 Difference]: Finished difference Result 2061 states and 2565 transitions. [2025-03-04 09:29:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:29:31,004 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-04 09:29:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:31,008 INFO L225 Difference]: With dead ends: 2061 [2025-03-04 09:29:31,008 INFO L226 Difference]: Without dead ends: 2058 [2025-03-04 09:29:31,008 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-04 09:29:31,009 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-04 09:29:31,009 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-04 09:29:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-04 09:29:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1347. [2025-03-04 09:29:31,022 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-04 09:29:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1709 transitions. [2025-03-04 09:29:31,023 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1709 transitions. Word has length 74 [2025-03-04 09:29:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:31,024 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1709 transitions. [2025-03-04 09:29:31,024 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-04 09:29:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1709 transitions. [2025-03-04 09:29:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:29:31,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:31,024 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-04 09:29:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:29:31,025 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-04 09:29:31,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -935803664, now seen corresponding path program 1 times [2025-03-04 09:29:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:31,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789166707] [2025-03-04 09:29:31,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:31,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:31,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:29:31,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:29:31,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:31,211 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-04 09:29:31,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:31,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789166707] [2025-03-04 09:29:31,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789166707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:31,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:31,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:31,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364538629] [2025-03-04 09:29:31,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:31,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:29:31,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:31,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:29:31,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:29:31,212 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-04 09:29:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:31,691 INFO L93 Difference]: Finished difference Result 1346 states and 1707 transitions. [2025-03-04 09:29:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:29:31,691 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-04 09:29:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:31,694 INFO L225 Difference]: With dead ends: 1346 [2025-03-04 09:29:31,694 INFO L226 Difference]: Without dead ends: 1346 [2025-03-04 09:29:31,694 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-04 09:29:31,695 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 2 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:31,695 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.5s Time] [2025-03-04 09:29:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-04 09:29:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2025-03-04 09:29:31,712 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-04 09:29:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1707 transitions. [2025-03-04 09:29:31,713 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1707 transitions. Word has length 83 [2025-03-04 09:29:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:31,714 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1707 transitions. [2025-03-04 09:29:31,714 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-04 09:29:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1707 transitions. [2025-03-04 09:29:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:29:31,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:31,714 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-04 09:29:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:29:31,715 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-04 09:29:31,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash -935803663, now seen corresponding path program 1 times [2025-03-04 09:29:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436780166] [2025-03-04 09:29:31,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:31,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:29:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:29:31,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:31,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:32,100 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-04 09:29:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436780166] [2025-03-04 09:29:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436780166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:29:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700038089] [2025-03-04 09:29:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:29:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:32,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:29:32,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:29:32,101 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-04 09:29:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:32,747 INFO L93 Difference]: Finished difference Result 1345 states and 1705 transitions. [2025-03-04 09:29:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:29:32,748 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-04 09:29:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:32,751 INFO L225 Difference]: With dead ends: 1345 [2025-03-04 09:29:32,751 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 09:29:32,751 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-04 09:29:32,751 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:32,751 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.6s Time] [2025-03-04 09:29:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 09:29:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2025-03-04 09:29:32,767 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-04 09:29:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1705 transitions. [2025-03-04 09:29:32,772 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1705 transitions. Word has length 83 [2025-03-04 09:29:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:32,772 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1705 transitions. [2025-03-04 09:29:32,772 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-04 09:29:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1705 transitions. [2025-03-04 09:29:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:29:32,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:32,774 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-04 09:29:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:29:32,774 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-04 09:29:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388205, now seen corresponding path program 1 times [2025-03-04 09:29:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800174772] [2025-03-04 09:29:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:32,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:29:32,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:29:32,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:32,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:32,973 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-04 09:29:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800174772] [2025-03-04 09:29:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800174772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:29:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093293159] [2025-03-04 09:29:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:29:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:29:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:29:32,975 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-04 09:29:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:33,516 INFO L93 Difference]: Finished difference Result 1363 states and 1731 transitions. [2025-03-04 09:29:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:29:33,517 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-04 09:29:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:33,525 INFO L225 Difference]: With dead ends: 1363 [2025-03-04 09:29:33,525 INFO L226 Difference]: Without dead ends: 1363 [2025-03-04 09:29:33,525 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-04 09:29:33,525 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 6 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:33,525 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.5s Time] [2025-03-04 09:29:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-04 09:29:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1354. [2025-03-04 09:29:33,542 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-04 09:29:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1721 transitions. [2025-03-04 09:29:33,544 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1721 transitions. Word has length 91 [2025-03-04 09:29:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:33,544 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1721 transitions. [2025-03-04 09:29:33,544 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-04 09:29:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1721 transitions. [2025-03-04 09:29:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:29:33,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:33,544 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-04 09:29:33,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:29:33,544 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-04 09:29:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388206, now seen corresponding path program 1 times [2025-03-04 09:29:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425338964] [2025-03-04 09:29:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:33,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:29:33,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:29:33,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:33,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:33,908 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-04 09:29:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425338964] [2025-03-04 09:29:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425338964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:33,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:29:33,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537029113] [2025-03-04 09:29:33,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:33,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:29:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:33,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:29:33,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:29:33,909 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-04 09:29:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:34,563 INFO L93 Difference]: Finished difference Result 1354 states and 1719 transitions. [2025-03-04 09:29:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:29:34,563 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-04 09:29:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:34,566 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 09:29:34,566 INFO L226 Difference]: Without dead ends: 1354 [2025-03-04 09:29:34,566 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-04 09:29:34,567 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-04 09:29:34,567 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-04 09:29:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-04 09:29:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-04 09:29:34,580 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-04 09:29:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1719 transitions. [2025-03-04 09:29:34,582 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1719 transitions. Word has length 91 [2025-03-04 09:29:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:34,582 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1719 transitions. [2025-03-04 09:29:34,583 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-04 09:29:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1719 transitions. [2025-03-04 09:29:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:29:34,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:34,583 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-04 09:29:34,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:29:34,583 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-04 09:29:34,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078027, now seen corresponding path program 1 times [2025-03-04 09:29:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110472932] [2025-03-04 09:29:34,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:34,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:29:34,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:29:34,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:34,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:34,910 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-04 09:29:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110472932] [2025-03-04 09:29:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110472932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950660785] [2025-03-04 09:29:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:34,912 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-04 09:29:34,914 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-04 09:29:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:29:35,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:29:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:35,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:29:35,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:35,102 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-04 09:29:35,220 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:29:35,220 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-04 09:29:35,251 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-04 09:29:35,317 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-04 09:29:35,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:35,467 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-04 09:29:35,501 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-04 09:29:35,524 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-04 09:29:35,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:29:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950660785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:35,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:29:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-04 09:29:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703511496] [2025-03-04 09:29:35,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:29:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:29:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:35,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:29:35,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=315, Unknown=9, NotChecked=0, Total=380 [2025-03-04 09:29:35,574 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-04 09:29:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:37,086 INFO L93 Difference]: Finished difference Result 1361 states and 1725 transitions. [2025-03-04 09:29:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:29:37,089 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-04 09:29:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:37,092 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 09:29:37,092 INFO L226 Difference]: Without dead ends: 1361 [2025-03-04 09:29:37,092 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-04 09:29:37,093 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:37,093 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.4s Time] [2025-03-04 09:29:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-04 09:29:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2025-03-04 09:29:37,105 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-04 09:29:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1719 transitions. [2025-03-04 09:29:37,106 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1719 transitions. Word has length 92 [2025-03-04 09:29:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1719 transitions. [2025-03-04 09:29:37,107 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-04 09:29:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1719 transitions. [2025-03-04 09:29:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:29:37,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:37,109 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-04 09:29:37,119 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-04 09:29:37,309 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-04 09:29:37,309 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-04 09:29:37,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078026, now seen corresponding path program 1 times [2025-03-04 09:29:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6947316] [2025-03-04 09:29:37,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:37,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:29:37,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:29:37,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:37,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:37,887 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-04 09:29:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6947316] [2025-03-04 09:29:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6947316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153888613] [2025-03-04 09:29:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:37,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:37,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:37,890 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-04 09:29:37,891 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-04 09:29:37,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:29:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:29:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:38,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 09:29:38,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:38,050 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-04 09:29:38,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:29:38,135 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-04 09:29:38,140 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-04 09:29:38,149 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-04 09:29:38,151 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-04 09:29:38,195 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-04 09:29:38,198 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-04 09:29:38,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:38,270 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-04 09:29:38,276 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-04 09:29:38,294 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-04 09:29:38,297 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-04 09:29:38,299 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-04 09:29:38,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:29:38,365 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-04 09:29:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153888613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:38,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:29:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-04 09:29:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011637472] [2025-03-04 09:29:38,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:29:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:29:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:29:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-04 09:29:38,367 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-04 09:29:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:40,088 INFO L93 Difference]: Finished difference Result 1360 states and 1723 transitions. [2025-03-04 09:29:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:29:40,088 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-04 09:29:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:40,090 INFO L225 Difference]: With dead ends: 1360 [2025-03-04 09:29:40,090 INFO L226 Difference]: Without dead ends: 1360 [2025-03-04 09:29:40,091 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-04 09:29:40,091 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:40,091 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.6s Time] [2025-03-04 09:29:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-04 09:29:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2025-03-04 09:29:40,100 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-04 09:29:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1706 transitions. [2025-03-04 09:29:40,101 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1706 transitions. Word has length 92 [2025-03-04 09:29:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1706 transitions. [2025-03-04 09:29:40,101 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-04 09:29:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1706 transitions. [2025-03-04 09:29:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:29:40,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:40,102 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-04 09:29:40,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:29:40,302 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-04 09:29:40,302 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-04 09:29:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499956, now seen corresponding path program 1 times [2025-03-04 09:29:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758317279] [2025-03-04 09:29:40,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:40,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:29:40,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:29:40,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:40,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:40,644 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-04 09:29:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758317279] [2025-03-04 09:29:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758317279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:29:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40824419] [2025-03-04 09:29:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:29:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:40,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:29:40,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:29:40,646 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-04 09:29:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:41,548 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-04 09:29:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:29:41,549 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-04 09:29:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:41,551 INFO L225 Difference]: With dead ends: 1367 [2025-03-04 09:29:41,551 INFO L226 Difference]: Without dead ends: 1367 [2025-03-04 09:29:41,551 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-04 09:29:41,551 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-04 09:29:41,551 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-04 09:29:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-04 09:29:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1363. [2025-03-04 09:29:41,563 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-04 09:29:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1725 transitions. [2025-03-04 09:29:41,564 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1725 transitions. Word has length 94 [2025-03-04 09:29:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:41,564 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1725 transitions. [2025-03-04 09:29:41,565 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-04 09:29:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1725 transitions. [2025-03-04 09:29:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:29:41,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:41,568 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-04 09:29:41,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 09:29:41,568 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-04 09:29:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499957, now seen corresponding path program 1 times [2025-03-04 09:29:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741455554] [2025-03-04 09:29:41,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:29:41,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:29:41,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:42,036 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-04 09:29:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741455554] [2025-03-04 09:29:42,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741455554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:42,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:42,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:29:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531673691] [2025-03-04 09:29:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:42,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:29:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:29:42,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:29:42,038 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-04 09:29:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:42,963 INFO L93 Difference]: Finished difference Result 1366 states and 1729 transitions. [2025-03-04 09:29:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:29:42,963 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-04 09:29:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:42,965 INFO L225 Difference]: With dead ends: 1366 [2025-03-04 09:29:42,965 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 09:29:42,965 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-04 09:29:42,966 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-04 09:29:42,966 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-04 09:29:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 09:29:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1363. [2025-03-04 09:29:42,976 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-04 09:29:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2025-03-04 09:29:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 94 [2025-03-04 09:29:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:42,977 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2025-03-04 09:29:42,977 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-04 09:29:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2025-03-04 09:29:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:29:42,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:42,978 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-04 09:29:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:29:42,978 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-04 09:29:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -990072660, now seen corresponding path program 1 times [2025-03-04 09:29:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925729705] [2025-03-04 09:29:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:42,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:29:43,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:29:43,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:43,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:43,337 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-04 09:29:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925729705] [2025-03-04 09:29:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925729705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028460704] [2025-03-04 09:29:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:43,343 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-04 09:29:43,348 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-04 09:29:43,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:29:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:29:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:43,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:29:43,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:43,575 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-04 09:29:43,675 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:29:43,675 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-04 09:29:43,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:29:43,763 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-04 09:29:43,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:43,859 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-04 09:29:43,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:43,925 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-04 09:29:43,938 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-04 09:29:43,960 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-04 09:29:43,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:29:43,971 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-04 09:29:44,010 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-04 09:29:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028460704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:44,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:29:44,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:29:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280059789] [2025-03-04 09:29:44,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:29:44,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:29:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:44,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:29:44,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2025-03-04 09:29:44,012 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-04 09:29:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:45,787 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2025-03-04 09:29:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:29:45,787 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-04 09:29:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:45,789 INFO L225 Difference]: With dead ends: 1365 [2025-03-04 09:29:45,789 INFO L226 Difference]: Without dead ends: 1365 [2025-03-04 09:29:45,789 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-04 09:29:45,789 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 692 mSDsluCounter, 5970 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:45,789 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.7s Time] [2025-03-04 09:29:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-04 09:29:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2025-03-04 09:29:45,797 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-04 09:29:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1721 transitions. [2025-03-04 09:29:45,799 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1721 transitions. Word has length 95 [2025-03-04 09:29:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:45,799 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1721 transitions. [2025-03-04 09:29:45,799 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-04 09:29:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1721 transitions. [2025-03-04 09:29:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:29:45,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:45,799 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-04 09:29:45,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:29:46,000 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-04 09:29:46,000 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-04 09:29:46,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash -990072659, now seen corresponding path program 1 times [2025-03-04 09:29:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:46,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989873447] [2025-03-04 09:29:46,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:46,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:29:46,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:29:46,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:46,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:46,504 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-04 09:29:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989873447] [2025-03-04 09:29:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989873447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706095499] [2025-03-04 09:29:46,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:46,513 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-04 09:29:46,514 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-04 09:29:46,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:29:46,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:29:46,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:46,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 09:29:46,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:46,687 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-04 09:29:46,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:29:46,766 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-04 09:29:46,770 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-04 09:29:46,777 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-04 09:29:46,783 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-04 09:29:46,823 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-04 09:29:46,827 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-04 09:29:46,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:46,901 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-04 09:29:46,913 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-04 09:29:46,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:46,958 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-04 09:29:46,963 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-04 09:29:46,973 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-04 09:29:46,975 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-04 09:29:46,978 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-04 09:29:46,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:29:47,022 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-04 09:29:47,030 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-04 09:29:47,064 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-04 09:29:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706095499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:47,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:29:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-04 09:29:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736974657] [2025-03-04 09:29:47,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:29:47,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:29:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:29:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-04 09:29:47,066 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-04 09:29:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:48,233 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2025-03-04 09:29:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:29:48,233 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-04 09:29:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:48,235 INFO L225 Difference]: With dead ends: 1364 [2025-03-04 09:29:48,235 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 09:29:48,235 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-04 09:29:48,236 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-04 09:29:48,236 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-04 09:29:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 09:29:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1346. [2025-03-04 09:29:48,246 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-04 09:29:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1702 transitions. [2025-03-04 09:29:48,248 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1702 transitions. Word has length 95 [2025-03-04 09:29:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:48,248 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1702 transitions. [2025-03-04 09:29:48,248 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-04 09:29:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1702 transitions. [2025-03-04 09:29:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:29:48,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:48,249 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-04 09:29:48,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:29:48,449 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-04 09:29:48,450 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-04 09:29:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891226, now seen corresponding path program 1 times [2025-03-04 09:29:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410999947] [2025-03-04 09:29:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:48,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:29:48,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:29:48,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:48,766 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-04 09:29:48,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:48,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410999947] [2025-03-04 09:29:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410999947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:48,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:48,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:29:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924498210] [2025-03-04 09:29:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:48,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:29:48,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:48,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:29:48,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:29:48,768 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-04 09:29:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:49,896 INFO L93 Difference]: Finished difference Result 1371 states and 1733 transitions. [2025-03-04 09:29:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:29:49,897 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-04 09:29:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:49,898 INFO L225 Difference]: With dead ends: 1371 [2025-03-04 09:29:49,898 INFO L226 Difference]: Without dead ends: 1371 [2025-03-04 09:29:49,899 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-04 09:29:49,899 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:49,899 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.0s Time] [2025-03-04 09:29:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-04 09:29:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1367. [2025-03-04 09:29:49,907 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-04 09:29:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1727 transitions. [2025-03-04 09:29:49,908 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1727 transitions. Word has length 97 [2025-03-04 09:29:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:49,908 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1727 transitions. [2025-03-04 09:29:49,908 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-04 09:29:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1727 transitions. [2025-03-04 09:29:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:29:49,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:49,909 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-04 09:29:49,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 09:29:49,909 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-04 09:29:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891225, now seen corresponding path program 1 times [2025-03-04 09:29:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923285799] [2025-03-04 09:29:49,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:49,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:29:49,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:29:49,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:49,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:50,350 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-04 09:29:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923285799] [2025-03-04 09:29:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923285799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:29:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:29:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:29:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024389029] [2025-03-04 09:29:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:29:50,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:29:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:50,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:29:50,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:29:50,351 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-04 09:29:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:51,611 INFO L93 Difference]: Finished difference Result 1370 states and 1731 transitions. [2025-03-04 09:29:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:29:51,611 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-04 09:29:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:51,613 INFO L225 Difference]: With dead ends: 1370 [2025-03-04 09:29:51,613 INFO L226 Difference]: Without dead ends: 1370 [2025-03-04 09:29:51,613 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-04 09:29:51,614 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 709 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 3526 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:51,614 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.2s Time] [2025-03-04 09:29:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-04 09:29:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1367. [2025-03-04 09:29:51,621 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-04 09:29:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1725 transitions. [2025-03-04 09:29:51,623 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1725 transitions. Word has length 97 [2025-03-04 09:29:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:51,623 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1725 transitions. [2025-03-04 09:29:51,623 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-04 09:29:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1725 transitions. [2025-03-04 09:29:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:29:51,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:51,624 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-04 09:29:51,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 09:29:51,624 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-04 09:29:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337554, now seen corresponding path program 1 times [2025-03-04 09:29:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379210520] [2025-03-04 09:29:51,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:29:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:29:51,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:51,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:51,982 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-04 09:29:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379210520] [2025-03-04 09:29:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379210520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627992471] [2025-03-04 09:29:51,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:51,985 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-04 09:29:51,987 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-04 09:29:52,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:29:52,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:29:52,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:52,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:52,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:29:52,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:52,193 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-04 09:29:52,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:29:52,271 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-04 09:29:52,294 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-04 09:29:52,348 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-04 09:29:52,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:52,501 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-04 09:29:52,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:52,603 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-04 09:29:52,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:52,664 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-04 09:29:52,681 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-04 09:29:52,720 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-04 09:29:52,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:29:52,787 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-04 09:29:56,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (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 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1527))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 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-04 09:29:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627992471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:56,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:29:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 09:29:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155674472] [2025-03-04 09:29:56,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:29:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:29:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:29:56,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:29:56,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=577, Unknown=26, NotChecked=102, Total=812 [2025-03-04 09:29:56,845 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-04 09:29:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:29:58,641 INFO L93 Difference]: Finished difference Result 1369 states and 1729 transitions. [2025-03-04 09:29:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:29:58,641 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-04 09:29:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:29:58,643 INFO L225 Difference]: With dead ends: 1369 [2025-03-04 09:29:58,643 INFO L226 Difference]: Without dead ends: 1369 [2025-03-04 09:29:58,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=130, Invalid=721, Unknown=27, NotChecked=114, Total=992 [2025-03-04 09:29:58,644 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 689 mSDsluCounter, 5020 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:29:58,644 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.7s Time] [2025-03-04 09:29:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-04 09:29:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2025-03-04 09:29:58,673 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-04 09:29:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1723 transitions. [2025-03-04 09:29:58,674 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1723 transitions. Word has length 98 [2025-03-04 09:29:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:29:58,674 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1723 transitions. [2025-03-04 09:29:58,674 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-04 09:29:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1723 transitions. [2025-03-04 09:29:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:29:58,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:29:58,675 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-04 09:29:58,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 09:29:58,875 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-04 09:29:58,876 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-04 09:29:58,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:29:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337553, now seen corresponding path program 1 times [2025-03-04 09:29:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:29:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378805897] [2025-03-04 09:29:58,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:29:58,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:29:58,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:29:58,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:59,453 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-04 09:29:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:29:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378805897] [2025-03-04 09:29:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378805897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:29:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894472946] [2025-03-04 09:29:59,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:29:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:29:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:29:59,455 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-04 09:29:59,456 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-04 09:29:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:29:59,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:29:59,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:29:59,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:29:59,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 09:29:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:29:59,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:29:59,722 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-04 09:29:59,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:29:59,727 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-04 09:29:59,750 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-04 09:29:59,753 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-04 09:29:59,821 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-04 09:29:59,824 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-04 09:29:59,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:59,897 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-04 09:29:59,904 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-04 09:29:59,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:29:59,960 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-04 09:29:59,970 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-04 09:30:00,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:00,010 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-04 09:30:00,017 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-04 09:30:00,027 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-04 09:30:00,030 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-04 09:30:00,044 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-04 09:30:00,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:00,093 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-04 09:30:00,106 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-04 09:30:00,122 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-04 09:30:00,133 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-04 09:30:00,187 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-04 09:30:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894472946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:00,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-04 09:30:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717684894] [2025-03-04 09:30:00,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:30:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:00,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:30:00,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-03-04 09:30:00,191 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-04 09:30:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:03,114 INFO L93 Difference]: Finished difference Result 1368 states and 1727 transitions. [2025-03-04 09:30:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:30:03,115 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-04 09:30:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:03,117 INFO L225 Difference]: With dead ends: 1368 [2025-03-04 09:30:03,117 INFO L226 Difference]: Without dead ends: 1368 [2025-03-04 09:30:03,117 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-04 09:30:03,118 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 697 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 5694 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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-04 09:30:03,118 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-04 09:30:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-04 09:30:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1344. [2025-03-04 09:30:03,128 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-04 09:30:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1698 transitions. [2025-03-04 09:30:03,130 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1698 transitions. Word has length 98 [2025-03-04 09:30:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:03,130 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1698 transitions. [2025-03-04 09:30:03,130 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-04 09:30:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1698 transitions. [2025-03-04 09:30:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:30:03,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:03,131 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-04 09:30:03,140 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-04 09:30:03,331 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-04 09:30:03,332 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-04 09:30:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466702, now seen corresponding path program 1 times [2025-03-04 09:30:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311075786] [2025-03-04 09:30:03,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:03,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:30:03,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:30:03,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:03,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:03,987 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-04 09:30:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311075786] [2025-03-04 09:30:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311075786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:03,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:30:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372047776] [2025-03-04 09:30:03,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:03,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:30:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:03,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:30:03,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:30:03,990 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-04 09:30:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:05,679 INFO L93 Difference]: Finished difference Result 1375 states and 1735 transitions. [2025-03-04 09:30:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:30:05,679 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-04 09:30:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:05,681 INFO L225 Difference]: With dead ends: 1375 [2025-03-04 09:30:05,681 INFO L226 Difference]: Without dead ends: 1375 [2025-03-04 09:30:05,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:30:05,682 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-04 09:30:05,682 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-04 09:30:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-04 09:30:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2025-03-04 09:30:05,695 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-04 09:30:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1729 transitions. [2025-03-04 09:30:05,696 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1729 transitions. Word has length 100 [2025-03-04 09:30:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:05,696 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1729 transitions. [2025-03-04 09:30:05,696 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-04 09:30:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1729 transitions. [2025-03-04 09:30:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:30:05,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:05,697 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-04 09:30:05,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 09:30:05,697 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-04 09:30:05,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466701, now seen corresponding path program 1 times [2025-03-04 09:30:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:05,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993109066] [2025-03-04 09:30:05,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:05,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:30:05,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:30:05,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:05,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:06,072 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-04 09:30:06,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993109066] [2025-03-04 09:30:06,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993109066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:06,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:06,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:30:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136220658] [2025-03-04 09:30:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:30:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:06,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:30:06,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:30:06,073 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-04 09:30:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:07,382 INFO L93 Difference]: Finished difference Result 1374 states and 1733 transitions. [2025-03-04 09:30:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:30:07,382 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-04 09:30:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:07,384 INFO L225 Difference]: With dead ends: 1374 [2025-03-04 09:30:07,384 INFO L226 Difference]: Without dead ends: 1374 [2025-03-04 09:30:07,384 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-04 09:30:07,385 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 727 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:07,385 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.2s Time] [2025-03-04 09:30:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-04 09:30:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1371. [2025-03-04 09:30:07,394 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-04 09:30:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1727 transitions. [2025-03-04 09:30:07,395 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1727 transitions. Word has length 100 [2025-03-04 09:30:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:07,395 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1727 transitions. [2025-03-04 09:30:07,395 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-04 09:30:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1727 transitions. [2025-03-04 09:30:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:30:07,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:07,396 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-04 09:30:07,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 09:30:07,396 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-04 09:30:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash -646877626, now seen corresponding path program 1 times [2025-03-04 09:30:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821399520] [2025-03-04 09:30:07,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:07,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:30:07,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:30:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:07,981 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-04 09:30:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821399520] [2025-03-04 09:30:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821399520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922262998] [2025-03-04 09:30:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:07,983 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-04 09:30:07,992 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-04 09:30:08,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:30:08,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:30:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:08,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 09:30:08,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:08,176 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-04 09:30:08,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:30:08,265 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-04 09:30:08,271 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-04 09:30:08,292 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-04 09:30:08,294 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-04 09:30:08,365 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-04 09:30:08,368 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-04 09:30:08,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:08,457 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-04 09:30:08,466 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-04 09:30:08,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:08,535 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-04 09:30:08,542 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-04 09:30:08,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:08,586 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-04 09:30:08,591 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-04 09:30:08,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:08,634 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-04 09:30:08,646 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-04 09:30:08,658 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-04 09:30:08,661 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-04 09:30:08,677 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-04 09:30:08,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:08,722 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_2034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2035 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-04 09:30:08,730 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))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:30:08,746 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-04 09:30:08,762 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-04 09:30:08,779 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-04 09:30:08,790 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-04 09:30:08,842 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-04 09:30:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922262998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:08,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-04 09:30:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283082412] [2025-03-04 09:30:08,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:30:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:30:08,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=570, Unknown=7, NotChecked=378, Total=1056 [2025-03-04 09:30:08,846 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-04 09:30:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:11,984 INFO L93 Difference]: Finished difference Result 1373 states and 1731 transitions. [2025-03-04 09:30:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:30:11,984 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-04 09:30:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:11,986 INFO L225 Difference]: With dead ends: 1373 [2025-03-04 09:30:11,986 INFO L226 Difference]: Without dead ends: 1373 [2025-03-04 09:30:11,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=913, Unknown=7, NotChecked=476, Total=1560 [2025-03-04 09:30:11,987 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 695 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 5996 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:11,987 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.9s Time] [2025-03-04 09:30:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-04 09:30:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1370. [2025-03-04 09:30:11,998 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-04 09:30:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1725 transitions. [2025-03-04 09:30:12,000 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1725 transitions. Word has length 101 [2025-03-04 09:30:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:12,000 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1725 transitions. [2025-03-04 09:30:12,000 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-04 09:30:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1725 transitions. [2025-03-04 09:30:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:30:12,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:12,001 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-04 09:30:12,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:30:12,205 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-04 09:30:12,205 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-04 09:30:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -646877627, now seen corresponding path program 1 times [2025-03-04 09:30:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982361533] [2025-03-04 09:30:12,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:30:12,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:30:12,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:12,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:12,622 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-04 09:30:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982361533] [2025-03-04 09:30:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982361533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174153467] [2025-03-04 09:30:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:12,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:12,624 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-04 09:30:12,625 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-04 09:30:12,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:30:12,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:30:12,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:12,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:12,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:30:12,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:12,819 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-04 09:30:12,908 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:30:12,908 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-04 09:30:12,933 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-04 09:30:12,996 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-04 09:30:13,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:13,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-04 09:30:13,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:13,156 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-04 09:30:13,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:13,196 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-04 09:30:13,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:13,238 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-04 09:30:13,249 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-04 09:30:13,273 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-04 09:30:13,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:13,349 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-04 09:30:13,429 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-04 09:30:13,436 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-04 09:30:13,457 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-04 09:30:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174153467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:13,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-04 09:30:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937707181] [2025-03-04 09:30:13,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:13,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:30:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:30:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=673, Unknown=26, NotChecked=228, Total=1056 [2025-03-04 09:30:13,460 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-04 09:30:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:15,552 INFO L93 Difference]: Finished difference Result 1372 states and 1729 transitions. [2025-03-04 09:30:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:30:15,556 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-04 09:30:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:15,558 INFO L225 Difference]: With dead ends: 1372 [2025-03-04 09:30:15,558 INFO L226 Difference]: Without dead ends: 1372 [2025-03-04 09:30:15,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=829, Unknown=27, NotChecked=252, Total=1260 [2025-03-04 09:30:15,558 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-04 09:30:15,558 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-04 09:30:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-04 09:30:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1342. [2025-03-04 09:30:15,566 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-04 09:30:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1694 transitions. [2025-03-04 09:30:15,567 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1694 transitions. Word has length 101 [2025-03-04 09:30:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1694 transitions. [2025-03-04 09:30:15,567 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-04 09:30:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1694 transitions. [2025-03-04 09:30:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:30:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:15,568 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-04 09:30:15,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:30:15,770 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-04 09:30:15,770 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-04 09:30:15,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash 164657031, now seen corresponding path program 1 times [2025-03-04 09:30:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183075545] [2025-03-04 09:30:15,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:15,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:30:15,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:30:15,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:16,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-04 09:30:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:16,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183075545] [2025-03-04 09:30:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183075545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:30:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052801679] [2025-03-04 09:30:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:30:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:16,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:30:16,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:30:16,319 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-04 09:30:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:17,739 INFO L93 Difference]: Finished difference Result 1381 states and 1739 transitions. [2025-03-04 09:30:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:30:17,739 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-04 09:30:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:17,741 INFO L225 Difference]: With dead ends: 1381 [2025-03-04 09:30:17,741 INFO L226 Difference]: Without dead ends: 1381 [2025-03-04 09:30:17,741 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-04 09:30:17,741 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-04 09:30:17,741 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-04 09:30:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-04 09:30:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-04 09:30:17,749 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-04 09:30:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1733 transitions. [2025-03-04 09:30:17,750 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1733 transitions. Word has length 104 [2025-03-04 09:30:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:17,750 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1733 transitions. [2025-03-04 09:30:17,750 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-04 09:30:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1733 transitions. [2025-03-04 09:30:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:30:17,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:17,751 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-04 09:30:17,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 09:30:17,751 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-04 09:30:17,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 164657032, now seen corresponding path program 1 times [2025-03-04 09:30:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852113015] [2025-03-04 09:30:17,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:17,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:30:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:30:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:18,537 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-04 09:30:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852113015] [2025-03-04 09:30:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852113015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:30:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284700438] [2025-03-04 09:30:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:30:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:18,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:30:18,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:30:18,538 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-04 09:30:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:20,697 INFO L93 Difference]: Finished difference Result 1380 states and 1737 transitions. [2025-03-04 09:30:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:30:20,698 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-04 09:30:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:20,700 INFO L225 Difference]: With dead ends: 1380 [2025-03-04 09:30:20,700 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 09:30:20,701 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-04 09:30:20,701 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 711 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:20,701 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.9s Time] [2025-03-04 09:30:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 09:30:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-03-04 09:30:20,710 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-04 09:30:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1731 transitions. [2025-03-04 09:30:20,711 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1731 transitions. Word has length 104 [2025-03-04 09:30:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:20,712 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1731 transitions. [2025-03-04 09:30:20,712 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-04 09:30:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1731 transitions. [2025-03-04 09:30:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:30:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:20,712 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-04 09:30:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 09:30:20,713 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-04 09:30:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -865823809, now seen corresponding path program 1 times [2025-03-04 09:30:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377144029] [2025-03-04 09:30:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:30:20,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:30:20,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:21,268 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-04 09:30:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377144029] [2025-03-04 09:30:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377144029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939547108] [2025-03-04 09:30:21,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:21,271 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-04 09:30:21,271 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-04 09:30:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:30:21,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:30:21,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:21,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:21,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 09:30:21,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:21,469 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-04 09:30:21,546 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:30:21,546 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-04 09:30:21,577 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-04 09:30:21,636 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-04 09:30:21,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:21,740 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-04 09:30:21,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:21,806 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-04 09:30:21,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:21,850 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-04 09:30:21,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:21,895 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-04 09:30:21,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:21,941 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-04 09:30:21,951 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-04 09:30:21,999 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 09:30:21,999 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-04 09:30:22,007 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-04 09:30:22,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:22,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939547108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:22,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:22,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2025-03-04 09:30:22,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738073104] [2025-03-04 09:30:22,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:22,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 09:30:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:22,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 09:30:22,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1163, Unknown=54, NotChecked=0, Total=1406 [2025-03-04 09:30:22,661 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-04 09:30:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:25,159 INFO L93 Difference]: Finished difference Result 1379 states and 1735 transitions. [2025-03-04 09:30:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:30:25,160 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-04 09:30:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:25,162 INFO L225 Difference]: With dead ends: 1379 [2025-03-04 09:30:25,162 INFO L226 Difference]: Without dead ends: 1379 [2025-03-04 09:30:25,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1371, Unknown=54, NotChecked=0, Total=1640 [2025-03-04 09:30:25,163 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 677 mSDsluCounter, 5914 mSDsCounter, 0 mSdLazyCounter, 4666 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:25,163 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.4s Time] [2025-03-04 09:30:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-03-04 09:30:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2025-03-04 09:30:25,171 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-04 09:30:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1729 transitions. [2025-03-04 09:30:25,172 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1729 transitions. Word has length 105 [2025-03-04 09:30:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1729 transitions. [2025-03-04 09:30:25,172 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-04 09:30:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1729 transitions. [2025-03-04 09:30:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:30:25,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:25,173 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-04 09:30:25,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:30:25,373 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-04 09:30:25,373 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-04 09:30:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -865823808, now seen corresponding path program 1 times [2025-03-04 09:30:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268024460] [2025-03-04 09:30:25,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:25,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:30:25,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:30:25,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:26,274 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-04 09:30:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268024460] [2025-03-04 09:30:26,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268024460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638759013] [2025-03-04 09:30:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:26,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:26,276 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-04 09:30:26,277 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-04 09:30:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:30:26,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:30:26,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:26,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:26,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 09:30:26,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:26,489 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-04 09:30:26,566 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-04 09:30:26,576 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:30:26,576 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-04 09:30:26,610 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-04 09:30:26,614 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-04 09:30:26,707 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-04 09:30:26,710 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-04 09:30:26,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:26,858 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-04 09:30:26,866 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-04 09:30:27,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:27,004 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-04 09:30:27,011 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-04 09:30:27,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:27,077 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-04 09:30:27,083 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-04 09:30:27,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:27,144 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-04 09:30:27,148 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-04 09:30:27,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:27,210 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-04 09:30:27,214 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-04 09:30:27,231 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-04 09:30:27,235 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-04 09:30:27,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:30:27,284 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-04 09:30:27,293 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:30:27,294 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-04 09:30:27,316 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-04 09:30:27,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638759013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:40,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-04 09:30:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762136454] [2025-03-04 09:30:40,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:40,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 09:30:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 09:30:40,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1461, Unknown=78, NotChecked=0, Total=1722 [2025-03-04 09:30:40,837 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)