./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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_FNV_test5-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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:40:10,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:40:10,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:40:10,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:40:10,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:40:10,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:40:10,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:40:10,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:40:10,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:40:10,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:40:10,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:40:10,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:40:10,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:40:10,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:40:10,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:40:10,461 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:40:10,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:40:10,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:40:10,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:40:10,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:40:10,463 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2025-03-17 13:40:10,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:40:10,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:40:10,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:40:10,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:40:10,686 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:40:10,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-03-17 13:40:11,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bff5bad/e02e81e8456e4ba1ace32fac09833d5b/FLAG3cb42ec61 [2025-03-17 13:40:12,206 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:40:12,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-03-17 13:40:12,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bff5bad/e02e81e8456e4ba1ace32fac09833d5b/FLAG3cb42ec61 [2025-03-17 13:40:12,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bff5bad/e02e81e8456e4ba1ace32fac09833d5b [2025-03-17 13:40:12,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:40:12,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:40:12,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:40:12,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:40:12,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:40:12,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12, skipping insertion in model container [2025-03-17 13:40:12,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:40:12,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-17 13:40:12,684 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-17 13:40:12,686 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-17 13:40:12,689 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-17 13:40:12,693 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-17 13:40:12,720 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-17 13:40:12,721 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-17 13:40:12,723 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-17 13:40:12,726 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-17 13:40:12,751 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-17 13:40:12,752 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-17 13:40:12,753 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-17 13:40:12,753 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-17 13:40:12,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:40:12,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:40:12,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:40:12,878 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:40:12,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12 WrapperNode [2025-03-17 13:40:12,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:40:12,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:40:12,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:40:12,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:40:12,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,961 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-03-17 13:40:12,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:40:12,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:40:12,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:40:12,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:40:12,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:12,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,065 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [323, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 83 writes are split as follows [82, 0, 1]. [2025-03-17 13:40:13,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:40:13,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:40:13,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:40:13,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:40:13,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (1/1) ... [2025-03-17 13:40:13,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:40:13,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:13,176 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-17 13:40:13,179 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-17 13:40:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 13:40:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 13:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:40:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 13:40:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:40:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:40:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:40:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:40:13,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:40:13,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:40:13,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:40:15,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 13:40:15,531 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-03-17 13:40:15,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:40:15,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:40:15,620 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 13:40:15,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:15 BoogieIcfgContainer [2025-03-17 13:40:15,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:40:15,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:40:15,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:40:15,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:40:15,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:40:12" (1/3) ... [2025-03-17 13:40:15,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4545c98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:15, skipping insertion in model container [2025-03-17 13:40:15,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:12" (2/3) ... [2025-03-17 13:40:15,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4545c98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:15, skipping insertion in model container [2025-03-17 13:40:15,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:15" (3/3) ... [2025-03-17 13:40:15,627 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2025-03-17 13:40:15,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:40:15,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-1.i that has 6 procedures, 1736 locations, 1 initial locations, 46 loop locations, and 712 error locations. [2025-03-17 13:40:15,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:40:15,704 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;@3499fd27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:40:15,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-03-17 13:40:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 1726 states, 1003 states have (on average 2.0388833499501495) internal successors, (2045), 1716 states have internal predecessors, (2045), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:40:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:40:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:15,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:40:15,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:15,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 66769438, now seen corresponding path program 1 times [2025-03-17 13:40:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797064756] [2025-03-17 13:40:15,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:15,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:40:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:40:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:15,834 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-17 13:40:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797064756] [2025-03-17 13:40:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797064756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:40:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005949190] [2025-03-17 13:40:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:15,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 13:40:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:15,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 13:40:15,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:40:15,861 INFO L87 Difference]: Start difference. First operand has 1726 states, 1003 states have (on average 2.0388833499501495) internal successors, (2045), 1716 states have internal predecessors, (2045), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:16,009 INFO L93 Difference]: Finished difference Result 1706 states and 1966 transitions. [2025-03-17 13:40:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 13:40:16,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:40:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:16,024 INFO L225 Difference]: With dead ends: 1706 [2025-03-17 13:40:16,024 INFO L226 Difference]: Without dead ends: 1704 [2025-03-17 13:40:16,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:40:16,027 INFO L435 NwaCegarLoop]: 1903 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:16,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1903 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-03-17 13:40:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2025-03-17 13:40:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 993 states have (on average 1.9536757301107754) internal successors, (1940), 1694 states have internal predecessors, (1940), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1964 transitions. [2025-03-17 13:40:16,127 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1964 transitions. Word has length 4 [2025-03-17 13:40:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1964 transitions. [2025-03-17 13:40:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1964 transitions. [2025-03-17 13:40:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:40:16,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:16,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:40:16,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:40:16,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:16,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 66769469, now seen corresponding path program 1 times [2025-03-17 13:40:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:16,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818111070] [2025-03-17 13:40:16,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:16,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:40:16,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:40:16,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:16,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:16,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-17 13:40:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818111070] [2025-03-17 13:40:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818111070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:16,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:40:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274425331] [2025-03-17 13:40:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:16,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:40:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:16,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:40:16,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:40:16,217 INFO L87 Difference]: Start difference. First operand 1704 states and 1964 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-17 13:40:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:17,199 INFO L93 Difference]: Finished difference Result 1928 states and 2276 transitions. [2025-03-17 13:40:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:40:17,199 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-17 13:40:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:17,205 INFO L225 Difference]: With dead ends: 1928 [2025-03-17 13:40:17,208 INFO L226 Difference]: Without dead ends: 1928 [2025-03-17 13:40:17,208 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-17 13:40:17,209 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 1726 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:17,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 1795 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:40:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-17 13:40:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1612. [2025-03-17 13:40:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 993 states have (on average 1.8610271903323263) internal successors, (1848), 1602 states have internal predecessors, (1848), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1872 transitions. [2025-03-17 13:40:17,248 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1872 transitions. Word has length 4 [2025-03-17 13:40:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:17,249 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 1872 transitions. [2025-03-17 13:40:17,249 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-17 13:40:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1872 transitions. [2025-03-17 13:40:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:40:17,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:17,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:40:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:40:17,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash 66769470, now seen corresponding path program 1 times [2025-03-17 13:40:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345653077] [2025-03-17 13:40:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:17,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:40:17,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:40:17,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:17,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:17,323 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-17 13:40:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345653077] [2025-03-17 13:40:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345653077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:40:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018124422] [2025-03-17 13:40:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:40:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:17,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:40:17,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:40:17,326 INFO L87 Difference]: Start difference. First operand 1612 states and 1872 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-17 13:40:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:18,337 INFO L93 Difference]: Finished difference Result 2342 states and 2766 transitions. [2025-03-17 13:40:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:40:18,338 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-17 13:40:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:18,344 INFO L225 Difference]: With dead ends: 2342 [2025-03-17 13:40:18,344 INFO L226 Difference]: Without dead ends: 2342 [2025-03-17 13:40:18,344 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-17 13:40:18,345 INFO L435 NwaCegarLoop]: 1856 mSDtfsCounter, 1208 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:18,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 2737 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:40:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-17 13:40:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1873. [2025-03-17 13:40:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1264 states have (on average 1.8354430379746836) internal successors, (2320), 1863 states have internal predecessors, (2320), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2344 transitions. [2025-03-17 13:40:18,373 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2344 transitions. Word has length 4 [2025-03-17 13:40:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:18,374 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2344 transitions. [2025-03-17 13:40:18,374 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-17 13:40:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2344 transitions. [2025-03-17 13:40:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:40:18,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:18,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:40:18,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:40:18,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:18,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash 65102749, now seen corresponding path program 1 times [2025-03-17 13:40:18,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54502204] [2025-03-17 13:40:18,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:18,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:40:18,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:40:18,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:18,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:18,398 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-17 13:40:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54502204] [2025-03-17 13:40:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54502204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:18,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:40:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270403763] [2025-03-17 13:40:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:40:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:18,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:40:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:40:18,400 INFO L87 Difference]: Start difference. First operand 1873 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:18,555 INFO L93 Difference]: Finished difference Result 3730 states and 4672 transitions. [2025-03-17 13:40:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:40:18,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:40:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:18,567 INFO L225 Difference]: With dead ends: 3730 [2025-03-17 13:40:18,567 INFO L226 Difference]: Without dead ends: 3730 [2025-03-17 13:40:18,568 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-17 13:40:18,569 INFO L435 NwaCegarLoop]: 2070 mSDtfsCounter, 1821 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 3860 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:18,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 3860 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2025-03-17 13:40:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 1875. [2025-03-17 13:40:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1266 states have (on average 1.8341232227488151) internal successors, (2322), 1865 states have internal predecessors, (2322), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2346 transitions. [2025-03-17 13:40:18,610 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2346 transitions. Word has length 4 [2025-03-17 13:40:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:18,610 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2346 transitions. [2025-03-17 13:40:18,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2346 transitions. [2025-03-17 13:40:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:40:18,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:18,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:18,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:40:18,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:18,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1585296687, now seen corresponding path program 1 times [2025-03-17 13:40:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159998094] [2025-03-17 13:40:18,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:18,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:40:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:40:18,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:18,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:18,669 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-17 13:40:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159998094] [2025-03-17 13:40:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159998094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:18,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:40:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078798372] [2025-03-17 13:40:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:40:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:40:18,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:40:18,672 INFO L87 Difference]: Start difference. First operand 1875 states and 2346 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:19,617 INFO L93 Difference]: Finished difference Result 1901 states and 2399 transitions. [2025-03-17 13:40:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:40:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 13:40:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:19,623 INFO L225 Difference]: With dead ends: 1901 [2025-03-17 13:40:19,623 INFO L226 Difference]: Without dead ends: 1901 [2025-03-17 13:40:19,623 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-17 13:40:19,624 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 1994 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:19,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 2037 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:40:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-17 13:40:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1852. [2025-03-17 13:40:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1266 states have (on average 1.815955766192733) internal successors, (2299), 1842 states have internal predecessors, (2299), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2323 transitions. [2025-03-17 13:40:19,669 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2323 transitions. Word has length 9 [2025-03-17 13:40:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:19,669 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2323 transitions. [2025-03-17 13:40:19,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2323 transitions. [2025-03-17 13:40:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:40:19,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:19,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:40:19,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1585296686, now seen corresponding path program 1 times [2025-03-17 13:40:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269838129] [2025-03-17 13:40:19,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:40:19,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:40:19,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:19,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269838129] [2025-03-17 13:40:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269838129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:19,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:19,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:40:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958618423] [2025-03-17 13:40:19,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:19,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:40:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:19,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:40:19,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:40:19,743 INFO L87 Difference]: Start difference. First operand 1852 states and 2323 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-17 13:40:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:19,830 INFO L93 Difference]: Finished difference Result 1777 states and 2220 transitions. [2025-03-17 13:40:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:40:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-17 13:40:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:19,836 INFO L225 Difference]: With dead ends: 1777 [2025-03-17 13:40:19,836 INFO L226 Difference]: Without dead ends: 1777 [2025-03-17 13:40:19,836 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-17 13:40:19,837 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 60 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3289 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-17 13:40:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2025-03-17 13:40:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1203 states have (on average 1.825436408977556) internal successors, (2196), 1767 states have internal predecessors, (2196), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2220 transitions. [2025-03-17 13:40:19,863 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2220 transitions. Word has length 9 [2025-03-17 13:40:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:19,863 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2220 transitions. [2025-03-17 13:40:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-17 13:40:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2220 transitions. [2025-03-17 13:40:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 13:40:19,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:19,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:40:19,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1899680038, now seen corresponding path program 1 times [2025-03-17 13:40:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951154487] [2025-03-17 13:40:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 13:40:19,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 13:40:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:19,930 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-17 13:40:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951154487] [2025-03-17 13:40:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951154487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:40:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838846366] [2025-03-17 13:40:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:40:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:19,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:40:19,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:40:19,931 INFO L87 Difference]: Start difference. First operand 1777 states and 2220 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 13:40:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:20,059 INFO L93 Difference]: Finished difference Result 1759 states and 2195 transitions. [2025-03-17 13:40:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:40:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-17 13:40:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:20,064 INFO L225 Difference]: With dead ends: 1759 [2025-03-17 13:40:20,064 INFO L226 Difference]: Without dead ends: 1759 [2025-03-17 13:40:20,064 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-17 13:40:20,064 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 41 mSDsluCounter, 3244 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:20,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4880 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-17 13:40:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1756. [2025-03-17 13:40:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1189 states have (on average 1.823380992430614) internal successors, (2168), 1746 states have internal predecessors, (2168), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2192 transitions. [2025-03-17 13:40:20,084 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2192 transitions. Word has length 10 [2025-03-17 13:40:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:20,084 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2192 transitions. [2025-03-17 13:40:20,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 13:40:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2192 transitions. [2025-03-17 13:40:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 13:40:20,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:20,085 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] [2025-03-17 13:40:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:40:20,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:20,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1746315184, now seen corresponding path program 1 times [2025-03-17 13:40:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303431324] [2025-03-17 13:40:20,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:20,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 13:40:20,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 13:40:20,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:20,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:20,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-17 13:40:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303431324] [2025-03-17 13:40:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303431324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:40:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031504273] [2025-03-17 13:40:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:40:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:40:20,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:40:20,215 INFO L87 Difference]: Start difference. First operand 1756 states and 2192 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 13:40:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:21,376 INFO L93 Difference]: Finished difference Result 2271 states and 2687 transitions. [2025-03-17 13:40:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:40:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-03-17 13:40:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:21,381 INFO L225 Difference]: With dead ends: 2271 [2025-03-17 13:40:21,381 INFO L226 Difference]: Without dead ends: 2271 [2025-03-17 13:40:21,381 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-17 13:40:21,382 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 1214 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:21,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3201 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:40:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2025-03-17 13:40:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1752. [2025-03-17 13:40:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1189 states have (on average 1.8200168208578638) internal successors, (2164), 1742 states have internal predecessors, (2164), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2188 transitions. [2025-03-17 13:40:21,400 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2188 transitions. Word has length 24 [2025-03-17 13:40:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:21,401 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2188 transitions. [2025-03-17 13:40:21,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 13:40:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2188 transitions. [2025-03-17 13:40:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 13:40:21,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:21,403 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] [2025-03-17 13:40:21,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:40:21,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:21,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1379029764, now seen corresponding path program 1 times [2025-03-17 13:40:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290687258] [2025-03-17 13:40:21,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 13:40:21,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 13:40:21,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:21,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:21,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290687258] [2025-03-17 13:40:21,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:21,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:21,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:40:21,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917436889] [2025-03-17 13:40:21,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:21,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:40:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:21,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:40:21,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:40:21,497 INFO L87 Difference]: Start difference. First operand 1752 states and 2188 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-17 13:40:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:21,606 INFO L93 Difference]: Finished difference Result 1752 states and 2184 transitions. [2025-03-17 13:40:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:40:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2025-03-17 13:40:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:21,610 INFO L225 Difference]: With dead ends: 1752 [2025-03-17 13:40:21,610 INFO L226 Difference]: Without dead ends: 1752 [2025-03-17 13:40:21,610 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-17 13:40:21,610 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 21 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:21,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4862 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-17 13:40:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2025-03-17 13:40:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1189 states have (on average 1.8166526492851136) internal successors, (2160), 1742 states have internal predecessors, (2160), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2184 transitions. [2025-03-17 13:40:21,627 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2184 transitions. Word has length 58 [2025-03-17 13:40:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:21,628 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2184 transitions. [2025-03-17 13:40:21,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-17 13:40:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2184 transitions. [2025-03-17 13:40:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 13:40:21,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:21,629 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] [2025-03-17 13:40:21,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:40:21,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 536629708, now seen corresponding path program 1 times [2025-03-17 13:40:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085597094] [2025-03-17 13:40:21,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 13:40:21,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 13:40:21,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:21,729 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-17 13:40:21,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:21,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085597094] [2025-03-17 13:40:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085597094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:21,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:40:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296485541] [2025-03-17 13:40:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:21,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:40:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:21,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:40:21,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:40:21,731 INFO L87 Difference]: Start difference. First operand 1752 states and 2184 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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-17 13:40:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:21,821 INFO L93 Difference]: Finished difference Result 1842 states and 2301 transitions. [2025-03-17 13:40:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:40:21,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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 66 [2025-03-17 13:40:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:21,825 INFO L225 Difference]: With dead ends: 1842 [2025-03-17 13:40:21,825 INFO L226 Difference]: Without dead ends: 1842 [2025-03-17 13:40:21,825 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-17 13:40:21,826 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 54 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:21,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3263 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:40:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-17 13:40:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2025-03-17 13:40:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1279 states have (on average 1.7802971071149336) internal successors, (2277), 1832 states have internal predecessors, (2277), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2301 transitions. [2025-03-17 13:40:21,845 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2301 transitions. Word has length 66 [2025-03-17 13:40:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:21,846 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2301 transitions. [2025-03-17 13:40:21,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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-17 13:40:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2301 transitions. [2025-03-17 13:40:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 13:40:21,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:21,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:21,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:40:21,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 866786184, now seen corresponding path program 1 times [2025-03-17 13:40:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063672411] [2025-03-17 13:40:21,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 13:40:21,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 13:40:21,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:22,276 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-17 13:40:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063672411] [2025-03-17 13:40:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063672411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:22,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:22,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:40:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215472089] [2025-03-17 13:40:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:40:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:22,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:40:22,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:40:22,277 INFO L87 Difference]: Start difference. First operand 1842 states and 2301 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:23,493 INFO L93 Difference]: Finished difference Result 1758 states and 2217 transitions. [2025-03-17 13:40:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:40:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 13:40:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:23,498 INFO L225 Difference]: With dead ends: 1758 [2025-03-17 13:40:23,498 INFO L226 Difference]: Without dead ends: 1758 [2025-03-17 13:40:23,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:40:23,498 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 1524 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 2197 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 13:40:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-03-17 13:40:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1487. [2025-03-17 13:40:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1008 states have (on average 1.6974206349206349) internal successors, (1711), 1477 states have internal predecessors, (1711), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1735 transitions. [2025-03-17 13:40:23,511 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1735 transitions. Word has length 69 [2025-03-17 13:40:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 1735 transitions. [2025-03-17 13:40:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:40:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1735 transitions. [2025-03-17 13:40:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:40:23,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:23,512 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-17 13:40:23,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:40:23,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -499017256, now seen corresponding path program 1 times [2025-03-17 13:40:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848671954] [2025-03-17 13:40:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:23,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:40:23,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:40:23,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:23,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848671954] [2025-03-17 13:40:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848671954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:23,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:23,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:40:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104105654] [2025-03-17 13:40:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:23,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:40:23,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:23,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:40:23,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:40:23,696 INFO L87 Difference]: Start difference. First operand 1487 states and 1735 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:24,508 INFO L93 Difference]: Finished difference Result 1486 states and 1734 transitions. [2025-03-17 13:40:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:40:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:24,512 INFO L225 Difference]: With dead ends: 1486 [2025-03-17 13:40:24,512 INFO L226 Difference]: Without dead ends: 1486 [2025-03-17 13:40:24,512 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-17 13:40:24,512 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 2 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:24,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4517 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:40:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-17 13:40:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2025-03-17 13:40:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1008 states have (on average 1.6964285714285714) internal successors, (1710), 1476 states have internal predecessors, (1710), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1734 transitions. [2025-03-17 13:40:24,537 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1734 transitions. Word has length 74 [2025-03-17 13:40:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:24,538 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1734 transitions. [2025-03-17 13:40:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1734 transitions. [2025-03-17 13:40:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:40:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:24,539 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-17 13:40:24,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:40:24,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -499017255, now seen corresponding path program 1 times [2025-03-17 13:40:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158563026] [2025-03-17 13:40:24,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:24,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:40:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:40:24,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:24,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:24,847 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-17 13:40:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158563026] [2025-03-17 13:40:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158563026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:40:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862101787] [2025-03-17 13:40:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:40:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:24,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:40:24,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:40:24,850 INFO L87 Difference]: Start difference. First operand 1486 states and 1734 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:25,754 INFO L93 Difference]: Finished difference Result 1485 states and 1733 transitions. [2025-03-17 13:40:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:40:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:25,757 INFO L225 Difference]: With dead ends: 1485 [2025-03-17 13:40:25,758 INFO L226 Difference]: Without dead ends: 1485 [2025-03-17 13:40:25,758 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-17 13:40:25,758 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 1 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:25,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4539 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:40:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2025-03-17 13:40:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2025-03-17 13:40:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1007 states have (on average 1.6971201588877856) internal successors, (1709), 1475 states have internal predecessors, (1709), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1733 transitions. [2025-03-17 13:40:25,769 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1733 transitions. Word has length 74 [2025-03-17 13:40:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 1733 transitions. [2025-03-17 13:40:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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-17 13:40:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1733 transitions. [2025-03-17 13:40:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:40:25,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:25,770 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] [2025-03-17 13:40:25,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:40:25,770 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -649869739, now seen corresponding path program 1 times [2025-03-17 13:40:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825679853] [2025-03-17 13:40:25,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:25,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:40:25,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:40:25,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:25,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:25,916 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-17 13:40:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825679853] [2025-03-17 13:40:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825679853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:40:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606107022] [2025-03-17 13:40:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:40:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:25,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:40:25,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:40:25,918 INFO L87 Difference]: Start difference. First operand 1485 states and 1733 transitions. Second operand has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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-17 13:40:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:27,069 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-03-17 13:40:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:40:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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 82 [2025-03-17 13:40:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:27,072 INFO L225 Difference]: With dead ends: 1497 [2025-03-17 13:40:27,072 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 13:40:27,072 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-17 13:40:27,073 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 13 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7077 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:27,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7077 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:40:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 13:40:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1491. [2025-03-17 13:40:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1012 states have (on average 1.6956521739130435) internal successors, (1716), 1480 states have internal predecessors, (1716), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:40:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1746 transitions. [2025-03-17 13:40:27,085 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1746 transitions. Word has length 82 [2025-03-17 13:40:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1746 transitions. [2025-03-17 13:40:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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-17 13:40:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1746 transitions. [2025-03-17 13:40:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:40:27,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:27,086 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] [2025-03-17 13:40:27,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:40:27,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -649869738, now seen corresponding path program 1 times [2025-03-17 13:40:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554542136] [2025-03-17 13:40:27,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:40:27,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:40:27,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:27,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:27,426 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-17 13:40:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554542136] [2025-03-17 13:40:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554542136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:40:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119874783] [2025-03-17 13:40:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:40:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:27,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:40:27,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:40:27,427 INFO L87 Difference]: Start difference. First operand 1491 states and 1746 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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-17 13:40:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:28,574 INFO L93 Difference]: Finished difference Result 1491 states and 1745 transitions. [2025-03-17 13:40:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:40:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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 82 [2025-03-17 13:40:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:28,577 INFO L225 Difference]: With dead ends: 1491 [2025-03-17 13:40:28,577 INFO L226 Difference]: Without dead ends: 1491 [2025-03-17 13:40:28,580 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-17 13:40:28,580 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 8 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5807 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:28,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5807 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:40:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-03-17 13:40:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-03-17 13:40:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1012 states have (on average 1.6946640316205535) internal successors, (1715), 1480 states have internal predecessors, (1715), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:40:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1745 transitions. [2025-03-17 13:40:28,600 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1745 transitions. Word has length 82 [2025-03-17 13:40:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1745 transitions. [2025-03-17 13:40:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 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-17 13:40:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1745 transitions. [2025-03-17 13:40:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:40:28,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:28,601 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-17 13:40:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:40:28,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:28,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1622217199, now seen corresponding path program 1 times [2025-03-17 13:40:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084551480] [2025-03-17 13:40:28,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:28,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:40:28,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:40:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:28,919 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-17 13:40:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084551480] [2025-03-17 13:40:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084551480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34398046] [2025-03-17 13:40:28,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:28,922 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-17 13:40:28,924 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-17 13:40:29,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:40:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:40:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:29,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 13:40:29,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:29,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:29,221 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-17 13:40:29,233 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-17 13:40:29,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:29,283 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-17 13:40:29,307 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-17 13:40:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:29,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:29,354 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 13:40:29,355 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 21 treesize of output 20 [2025-03-17 13:40:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34398046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:29,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-03-17 13:40:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739643643] [2025-03-17 13:40:29,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:29,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:40:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:29,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:40:29,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=170, Unknown=5, NotChecked=0, Total=210 [2025-03-17 13:40:29,386 INFO L87 Difference]: Start difference. First operand 1491 states and 1745 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:40:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:31,414 INFO L93 Difference]: Finished difference Result 1490 states and 1744 transitions. [2025-03-17 13:40:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:40:31,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2025-03-17 13:40:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:31,417 INFO L225 Difference]: With dead ends: 1490 [2025-03-17 13:40:31,418 INFO L226 Difference]: Without dead ends: 1490 [2025-03-17 13:40:31,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=373, Unknown=5, NotChecked=0, Total=462 [2025-03-17 13:40:31,418 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 1551 mSDsluCounter, 7644 mSDsCounter, 0 mSdLazyCounter, 5881 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 8623 SdHoareTripleChecker+Invalid, 5908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:31,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 8623 Invalid, 5908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5881 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:40:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-17 13:40:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2025-03-17 13:40:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1012 states have (on average 1.6936758893280632) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:40:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1744 transitions. [2025-03-17 13:40:31,430 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1744 transitions. Word has length 83 [2025-03-17 13:40:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:31,431 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1744 transitions. [2025-03-17 13:40:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:40:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1744 transitions. [2025-03-17 13:40:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:40:31,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:31,431 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-17 13:40:31,440 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-17 13:40:31,636 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,SelfDestructingSolverStorable15 [2025-03-17 13:40:31,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:31,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1622217198, now seen corresponding path program 1 times [2025-03-17 13:40:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091254753] [2025-03-17 13:40:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:31,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:40:31,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:40:31,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:31,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:32,116 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-17 13:40:32,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091254753] [2025-03-17 13:40:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091254753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273500010] [2025-03-17 13:40:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:32,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:32,118 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-17 13:40:32,120 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-17 13:40:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:40:32,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:40:32,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:32,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:32,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 13:40:32,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:32,376 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-17 13:40:32,382 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:32,383 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-17 13:40:32,392 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-17 13:40:32,396 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-17 13:40:32,441 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-17 13:40:32,443 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-17 13:40:32,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:32,518 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-17 13:40:32,525 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-17 13:40:32,549 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-17 13:40:32,553 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-17 13:40:32,556 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-17 13:40:32,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273500010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:32,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-03-17 13:40:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187883217] [2025-03-17 13:40:32,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:32,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:40:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:32,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:40:32,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=248, Unknown=6, NotChecked=0, Total=306 [2025-03-17 13:40:32,667 INFO L87 Difference]: Start difference. First operand 1490 states and 1744 transitions. Second operand has 15 states, 12 states have (on average 8.5) internal successors, (102), 15 states have internal predecessors, (102), 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-17 13:40:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:35,632 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-03-17 13:40:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:40:35,632 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.5) internal successors, (102), 15 states have internal predecessors, (102), 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 83 [2025-03-17 13:40:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:35,635 INFO L225 Difference]: With dead ends: 1497 [2025-03-17 13:40:35,635 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 13:40:35,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=374, Unknown=7, NotChecked=0, Total=462 [2025-03-17 13:40:35,635 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1551 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 7182 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 7298 SdHoareTripleChecker+Invalid, 7223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 7182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:35,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 7298 Invalid, 7223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 7182 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 13:40:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 13:40:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1488. [2025-03-17 13:40:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1011 states have (on average 1.6933728981206726) internal successors, (1712), 1477 states have internal predecessors, (1712), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1736 transitions. [2025-03-17 13:40:35,648 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1736 transitions. Word has length 83 [2025-03-17 13:40:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:35,648 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1736 transitions. [2025-03-17 13:40:35,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.5) internal successors, (102), 15 states have internal predecessors, (102), 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-17 13:40:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1736 transitions. [2025-03-17 13:40:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:40:35,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:35,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:35,667 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-17 13:40:35,849 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,SelfDestructingSolverStorable16 [2025-03-17 13:40:35,849 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:35,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1444876729, now seen corresponding path program 1 times [2025-03-17 13:40:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339473760] [2025-03-17 13:40:35,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:35,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:40:35,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:40:35,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:35,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:36,152 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-17 13:40:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339473760] [2025-03-17 13:40:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339473760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:36,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:40:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13053787] [2025-03-17 13:40:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:40:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:36,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:40:36,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:40:36,153 INFO L87 Difference]: Start difference. First operand 1488 states and 1736 transitions. Second operand has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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-17 13:40:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:38,094 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:40:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:40:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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 85 [2025-03-17 13:40:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:38,097 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:40:38,097 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:40:38,097 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-17 13:40:38,097 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1536 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 5878 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 8609 SdHoareTripleChecker+Invalid, 5903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:38,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 8609 Invalid, 5903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5878 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 13:40:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:40:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1497. [2025-03-17 13:40:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1019 states have (on average 1.689892051030422) internal successors, (1722), 1485 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1747 transitions. [2025-03-17 13:40:38,110 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1747 transitions. Word has length 85 [2025-03-17 13:40:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1747 transitions. [2025-03-17 13:40:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 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-17 13:40:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1747 transitions. [2025-03-17 13:40:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:40:38,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:38,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:40:38,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:40:38,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1444876730, now seen corresponding path program 1 times [2025-03-17 13:40:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228863831] [2025-03-17 13:40:38,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:38,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:40:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:40:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:38,538 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-17 13:40:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228863831] [2025-03-17 13:40:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228863831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:40:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53273800] [2025-03-17 13:40:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:38,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:40:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:40:38,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:40:38,539 INFO L87 Difference]: Start difference. First operand 1497 states and 1747 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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-17 13:40:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:40,646 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:40:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:40:40,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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 85 [2025-03-17 13:40:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:40,648 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:40:40,648 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:40:40,649 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-17 13:40:40,649 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 1549 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 5429 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:40,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 5842 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5429 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:40:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:40:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1497. [2025-03-17 13:40:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1019 states have (on average 1.6889106967615308) internal successors, (1721), 1485 states have internal predecessors, (1721), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1746 transitions. [2025-03-17 13:40:40,660 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1746 transitions. Word has length 85 [2025-03-17 13:40:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:40,660 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1746 transitions. [2025-03-17 13:40:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 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-17 13:40:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1746 transitions. [2025-03-17 13:40:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:40:40,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:40,661 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] [2025-03-17 13:40:40,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:40:40,661 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:40,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash -498859907, now seen corresponding path program 1 times [2025-03-17 13:40:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000201075] [2025-03-17 13:40:40,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:40,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:40:40,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:40:40,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:40,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:40,950 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-17 13:40:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000201075] [2025-03-17 13:40:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000201075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714898756] [2025-03-17 13:40:40,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:40,953 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-17 13:40:40,956 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-17 13:40:41,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:40:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:40:41,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:41,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:41,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 13:40:41,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:41,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:41,204 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-17 13:40:41,209 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-17 13:40:41,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:41,269 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-17 13:40:41,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:41,310 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-17 13:40:41,322 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-17 13:40:41,324 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-17 13:40:41,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:41,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:40:41,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:40:41,360 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 13:40:41,360 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 33 treesize of output 32 [2025-03-17 13:40:41,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_929))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-17 13:40:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714898756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:41,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2025-03-17 13:40:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269445887] [2025-03-17 13:40:41,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:40:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:41,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:40:41,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=229, Unknown=3, NotChecked=96, Total=380 [2025-03-17 13:40:41,366 INFO L87 Difference]: Start difference. First operand 1497 states and 1746 transitions. Second operand has 17 states, 15 states have (on average 7.133333333333334) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:40:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:43,572 INFO L93 Difference]: Finished difference Result 1499 states and 1753 transitions. [2025-03-17 13:40:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:40:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.133333333333334) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-03-17 13:40:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:43,575 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 13:40:43,575 INFO L226 Difference]: Without dead ends: 1499 [2025-03-17 13:40:43,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-17 13:40:43,575 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1543 mSDsluCounter, 9522 mSDsCounter, 0 mSdLazyCounter, 7145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 10500 SdHoareTripleChecker+Invalid, 7172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:43,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 10500 Invalid, 7172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7145 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:40:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-17 13:40:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1496. [2025-03-17 13:40:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1019 states have (on average 1.6879293424926398) internal successors, (1720), 1484 states have internal predecessors, (1720), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1745 transitions. [2025-03-17 13:40:43,586 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1745 transitions. Word has length 86 [2025-03-17 13:40:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:43,586 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1745 transitions. [2025-03-17 13:40:43,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.133333333333334) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:40:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1745 transitions. [2025-03-17 13:40:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:40:43,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:43,587 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] [2025-03-17 13:40:43,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:40:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:43,788 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash -498859906, now seen corresponding path program 1 times [2025-03-17 13:40:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727396285] [2025-03-17 13:40:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:43,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:40:43,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:40:43,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:44,222 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-17 13:40:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727396285] [2025-03-17 13:40:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727396285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355292951] [2025-03-17 13:40:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:44,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:44,225 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-17 13:40:44,226 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-17 13:40:44,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:40:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:40:44,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 13:40:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:44,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:44,490 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-17 13:40:44,493 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-17 13:40:44,515 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-17 13:40:44,519 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-17 13:40:44,579 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-17 13:40:44,583 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-17 13:40:44,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:44,658 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-17 13:40:44,665 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-17 13:40:44,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:44,720 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-17 13:40:44,725 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-17 13:40:44,739 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-17 13:40:44,742 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-17 13:40:44,756 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-17 13:40:44,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:44,854 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1069 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:40:44,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-17 13:40:44,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355292951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:44,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:44,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2025-03-17 13:40:44,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931292412] [2025-03-17 13:40:44,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:40:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:40:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=425, Unknown=13, NotChecked=86, Total=600 [2025-03-17 13:40:44,896 INFO L87 Difference]: Start difference. First operand 1496 states and 1745 transitions. Second operand has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 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-17 13:40:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:47,906 INFO L93 Difference]: Finished difference Result 1498 states and 1752 transitions. [2025-03-17 13:40:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:40:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 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 86 [2025-03-17 13:40:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:47,908 INFO L225 Difference]: With dead ends: 1498 [2025-03-17 13:40:47,908 INFO L226 Difference]: Without dead ends: 1498 [2025-03-17 13:40:47,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=628, Unknown=16, NotChecked=106, Total=870 [2025-03-17 13:40:47,909 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 1549 mSDsluCounter, 7287 mSDsCounter, 0 mSdLazyCounter, 7831 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 8270 SdHoareTripleChecker+Invalid, 7859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:47,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 8270 Invalid, 7859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 7831 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 13:40:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-17 13:40:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1486. [2025-03-17 13:40:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1011 states have (on average 1.6913946587537092) internal successors, (1710), 1475 states have internal predecessors, (1710), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:40:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1734 transitions. [2025-03-17 13:40:47,923 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1734 transitions. Word has length 86 [2025-03-17 13:40:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:47,923 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1734 transitions. [2025-03-17 13:40:47,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 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-17 13:40:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1734 transitions. [2025-03-17 13:40:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:40:47,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:47,924 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] [2025-03-17 13:40:47,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 13:40:48,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:48,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 162087086, now seen corresponding path program 1 times [2025-03-17 13:40:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063495019] [2025-03-17 13:40:48,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:48,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:40:48,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:40:48,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:48,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063495019] [2025-03-17 13:40:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063495019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:40:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834568425] [2025-03-17 13:40:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:48,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:40:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:48,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:40:48,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:40:48,564 INFO L87 Difference]: Start difference. First operand 1486 states and 1734 transitions. Second operand has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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-17 13:40:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:51,176 INFO L93 Difference]: Finished difference Result 1502 states and 1756 transitions. [2025-03-17 13:40:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:40:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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 88 [2025-03-17 13:40:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:51,181 INFO L225 Difference]: With dead ends: 1502 [2025-03-17 13:40:51,181 INFO L226 Difference]: Without dead ends: 1502 [2025-03-17 13:40:51,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:40:51,183 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1541 mSDsluCounter, 10475 mSDsCounter, 0 mSdLazyCounter, 7823 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 11452 SdHoareTripleChecker+Invalid, 7849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:51,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 11452 Invalid, 7849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7823 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 13:40:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-17 13:40:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1498. [2025-03-17 13:40:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1022 states have (on average 1.6859099804305284) internal successors, (1723), 1486 states have internal predecessors, (1723), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1748 transitions. [2025-03-17 13:40:51,192 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1748 transitions. Word has length 88 [2025-03-17 13:40:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:51,193 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1748 transitions. [2025-03-17 13:40:51,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 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-17 13:40:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1748 transitions. [2025-03-17 13:40:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:40:51,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:51,193 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] [2025-03-17 13:40:51,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:40:51,194 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 162087087, now seen corresponding path program 1 times [2025-03-17 13:40:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449120202] [2025-03-17 13:40:51,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:51,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:40:51,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:40:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:40:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449120202] [2025-03-17 13:40:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449120202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:40:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:40:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:40:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51955888] [2025-03-17 13:40:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:40:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:40:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:51,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:40:51,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:40:51,747 INFO L87 Difference]: Start difference. First operand 1498 states and 1748 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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-17 13:40:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:53,572 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:40:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:40:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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 88 [2025-03-17 13:40:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:53,574 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:40:53,574 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:40:53,574 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-17 13:40:53,575 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1534 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 4582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:53,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 5109 Invalid, 4582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:40:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:40:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1498. [2025-03-17 13:40:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1022 states have (on average 1.6849315068493151) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1747 transitions. [2025-03-17 13:40:53,585 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1747 transitions. Word has length 88 [2025-03-17 13:40:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:53,585 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1747 transitions. [2025-03-17 13:40:53,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 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-17 13:40:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1747 transitions. [2025-03-17 13:40:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:40:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:53,586 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] [2025-03-17 13:40:53,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:40:53,586 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:53,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -946951318, now seen corresponding path program 1 times [2025-03-17 13:40:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095469468] [2025-03-17 13:40:53,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:53,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:40:53,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:40:53,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:53,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:53,972 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-17 13:40:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095469468] [2025-03-17 13:40:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095469468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436664846] [2025-03-17 13:40:53,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:53,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:53,974 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-17 13:40:53,976 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-17 13:40:54,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:40:54,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:40:54,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:54,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:54,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:40:54,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:54,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:54,345 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-17 13:40:54,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 13:40:54,374 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-17 13:40:54,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:54,520 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-17 13:40:54,524 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-17 13:40:54,561 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 19 treesize of output 7 [2025-03-17 13:40:54,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:40:54,587 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2025-03-17 13:40:54,648 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:54,648 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-17 13:40:54,661 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-17 13:40:54,663 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-17 13:40:54,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:54,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1361) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:40:54,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:40:54,931 INFO L349 Elim1Store]: treesize reduction 5, result has 94.5 percent of original size [2025-03-17 13:40:54,931 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 95 treesize of output 94 [2025-03-17 13:40:54,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 Int) (v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1361 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem52#1.offset_15| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1367))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_15| 16) v_ArrVal_1360)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1361)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_#t~mem52#1.offset_15| (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2025-03-17 13:40:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436664846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:54,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2025-03-17 13:40:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174082354] [2025-03-17 13:40:54,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:54,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 13:40:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:54,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 13:40:54,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=734, Unknown=30, NotChecked=174, Total=1056 [2025-03-17 13:40:54,945 INFO L87 Difference]: Start difference. First operand 1498 states and 1747 transitions. Second operand has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 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-17 13:40:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:40:58,547 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:40:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:40:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 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 89 [2025-03-17 13:40:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:40:58,549 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:40:58,549 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:40:58,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1236, Unknown=30, NotChecked=228, Total=1722 [2025-03-17 13:40:58,550 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 4556 mSDsluCounter, 15272 mSDsCounter, 0 mSdLazyCounter, 11040 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4571 SdHoareTripleChecker+Valid, 16247 SdHoareTripleChecker+Invalid, 11121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 11040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:40:58,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4571 Valid, 16247 Invalid, 11121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 11040 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 13:40:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:40:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1497. [2025-03-17 13:40:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1022 states have (on average 1.6839530332681019) internal successors, (1721), 1485 states have internal predecessors, (1721), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:40:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1746 transitions. [2025-03-17 13:40:58,560 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1746 transitions. Word has length 89 [2025-03-17 13:40:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:40:58,560 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1746 transitions. [2025-03-17 13:40:58,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 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-17 13:40:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1746 transitions. [2025-03-17 13:40:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:40:58,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:40:58,560 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] [2025-03-17 13:40:58,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 13:40:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 13:40:58,761 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:40:58,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:40:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -946951317, now seen corresponding path program 1 times [2025-03-17 13:40:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:40:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065543459] [2025-03-17 13:40:58,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:40:58,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:40:58,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:40:58,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:58,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:59,241 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-17 13:40:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:40:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065543459] [2025-03-17 13:40:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065543459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300183537] [2025-03-17 13:40:59,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:40:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:40:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:40:59,244 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-17 13:40:59,245 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-17 13:40:59,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:40:59,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:40:59,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:40:59,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:40:59,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 13:40:59,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:40:59,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:40:59,492 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-17 13:40:59,497 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-17 13:40:59,514 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-17 13:40:59,516 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-17 13:40:59,567 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-17 13:40:59,569 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-17 13:40:59,632 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:59,632 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-17 13:40:59,639 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-17 13:40:59,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:59,711 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-17 13:40:59,717 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-17 13:40:59,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:40:59,758 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-17 13:40:59,762 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-17 13:40:59,775 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-17 13:40:59,779 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-17 13:40:59,792 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-17 13:40:59,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:40:59,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1522 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:40:59,838 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1522 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-03-17 13:40:59,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1519))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1520) .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1520) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-03-17 13:40:59,856 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1519))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1520) .cse1 v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1520) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-17 13:40:59,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1528))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1519))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1527) .cse0 v_ArrVal_1520) .cse1 v_ArrVal_1522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1528))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1527) .cse5 v_ArrVal_1520) (select (select (store .cse6 .cse5 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1522))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-17 13:40:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300183537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:40:59,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:40:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-03-17 13:40:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40691771] [2025-03-17 13:40:59,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:40:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:40:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:40:59,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:40:59,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2025-03-17 13:40:59,894 INFO L87 Difference]: Start difference. First operand 1497 states and 1746 transitions. Second operand has 22 states, 19 states have (on average 6.315789473684211) internal successors, (120), 22 states have internal predecessors, (120), 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-17 13:41:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:03,012 INFO L93 Difference]: Finished difference Result 1499 states and 1753 transitions. [2025-03-17 13:41:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:41:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.315789473684211) internal successors, (120), 22 states have internal predecessors, (120), 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 89 [2025-03-17 13:41:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:03,014 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 13:41:03,014 INFO L226 Difference]: Without dead ends: 1499 [2025-03-17 13:41:03,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2025-03-17 13:41:03,015 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 1545 mSDsluCounter, 8029 mSDsCounter, 0 mSdLazyCounter, 8695 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 9011 SdHoareTripleChecker+Invalid, 8726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:03,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 9011 Invalid, 8726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8695 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 13:41:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-17 13:41:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1484. [2025-03-17 13:41:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1011 states have (on average 1.6894164193867458) internal successors, (1708), 1473 states have internal predecessors, (1708), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:41:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1732 transitions. [2025-03-17 13:41:03,025 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1732 transitions. Word has length 89 [2025-03-17 13:41:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1732 transitions. [2025-03-17 13:41:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.315789473684211) internal successors, (120), 22 states have internal predecessors, (120), 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-17 13:41:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1732 transitions. [2025-03-17 13:41:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:41:03,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:03,029 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-17 13:41:03,037 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-17 13:41:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:41:03,230 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:03,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1194825330, now seen corresponding path program 1 times [2025-03-17 13:41:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963079376] [2025-03-17 13:41:03,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:03,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:41:03,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:41:03,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:03,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:03,596 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-17 13:41:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963079376] [2025-03-17 13:41:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963079376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:41:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:41:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:41:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131235492] [2025-03-17 13:41:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:41:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:41:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:41:03,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:41:03,597 INFO L87 Difference]: Start difference. First operand 1484 states and 1732 transitions. Second operand has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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-17 13:41:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:05,721 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-03-17 13:41:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:41:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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-17 13:41:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:05,724 INFO L225 Difference]: With dead ends: 1503 [2025-03-17 13:41:05,724 INFO L226 Difference]: Without dead ends: 1503 [2025-03-17 13:41:05,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:41:05,725 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 1553 mSDsluCounter, 8589 mSDsCounter, 0 mSdLazyCounter, 6538 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 9565 SdHoareTripleChecker+Invalid, 6563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:05,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 9565 Invalid, 6563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6538 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:41:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-17 13:41:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1499. [2025-03-17 13:41:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1487 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1749 transitions. [2025-03-17 13:41:05,737 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1749 transitions. Word has length 91 [2025-03-17 13:41:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1749 transitions. [2025-03-17 13:41:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 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-17 13:41:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1749 transitions. [2025-03-17 13:41:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:41:05,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:05,738 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-17 13:41:05,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 13:41:05,738 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:05,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1194825331, now seen corresponding path program 1 times [2025-03-17 13:41:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:05,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261366156] [2025-03-17 13:41:05,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:05,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:41:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:41:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:06,294 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-17 13:41:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261366156] [2025-03-17 13:41:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261366156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:41:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:41:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 13:41:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252408077] [2025-03-17 13:41:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:41:06,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:41:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:06,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:41:06,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:41:06,296 INFO L87 Difference]: Start difference. First operand 1499 states and 1749 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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-17 13:41:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:08,515 INFO L93 Difference]: Finished difference Result 1502 states and 1756 transitions. [2025-03-17 13:41:08,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:41:08,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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-17 13:41:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:08,517 INFO L225 Difference]: With dead ends: 1502 [2025-03-17 13:41:08,517 INFO L226 Difference]: Without dead ends: 1502 [2025-03-17 13:41:08,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 13:41:08,518 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 1552 mSDsluCounter, 5785 mSDsCounter, 0 mSdLazyCounter, 6051 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 6768 SdHoareTripleChecker+Invalid, 6075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:08,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 6768 Invalid, 6075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6051 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:41:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-17 13:41:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1499. [2025-03-17 13:41:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1025 states have (on average 1.6809756097560975) internal successors, (1723), 1487 states have internal predecessors, (1723), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1748 transitions. [2025-03-17 13:41:08,528 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1748 transitions. Word has length 91 [2025-03-17 13:41:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:08,528 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1748 transitions. [2025-03-17 13:41:08,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 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-17 13:41:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1748 transitions. [2025-03-17 13:41:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:41:08,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:08,529 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-17 13:41:08,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:41:08,529 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1279827402, now seen corresponding path program 1 times [2025-03-17 13:41:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915415010] [2025-03-17 13:41:08,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:08,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:41:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:41:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:08,907 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-17 13:41:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915415010] [2025-03-17 13:41:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915415010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853827477] [2025-03-17 13:41:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:08,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:41:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:41:08,909 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-17 13:41:08,911 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-17 13:41:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:41:09,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:41:09,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:09,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 13:41:09,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:41:09,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:41:09,177 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-17 13:41:09,181 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-17 13:41:09,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:09,239 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-17 13:41:09,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:09,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 42 treesize of output 41 [2025-03-17 13:41:09,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:09,301 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-17 13:41:09,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:09,332 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-17 13:41:09,338 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-17 13:41:09,340 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-17 13:41:09,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:41:09,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1834) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:41:09,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1833 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1833))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1834)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:41:13,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1834)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:41:13,557 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-17 13:41:13,557 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 105 treesize of output 104 [2025-03-17 13:41:13,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1837))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1834)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-17 13:41:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853827477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:13,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:41:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2025-03-17 13:41:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310145171] [2025-03-17 13:41:13,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:41:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:41:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:41:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=447, Unknown=30, NotChecked=188, Total=756 [2025-03-17 13:41:13,566 INFO L87 Difference]: Start difference. First operand 1499 states and 1748 transitions. Second operand has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 21 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:41:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:15,603 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:41:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:41:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 21 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-03-17 13:41:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:15,606 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:41:15,606 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:41:15,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=174, Invalid=863, Unknown=35, NotChecked=260, Total=1332 [2025-03-17 13:41:15,607 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 1549 mSDsluCounter, 5734 mSDsCounter, 0 mSdLazyCounter, 4582 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 6710 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 6710 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4582 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:41:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:41:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1498. [2025-03-17 13:41:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1747 transitions. [2025-03-17 13:41:15,622 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1747 transitions. Word has length 92 [2025-03-17 13:41:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:15,622 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1747 transitions. [2025-03-17 13:41:15,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 21 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:41:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1747 transitions. [2025-03-17 13:41:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:41:15,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:15,623 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-17 13:41:15,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 13:41:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:41:15,824 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1279827401, now seen corresponding path program 1 times [2025-03-17 13:41:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799996448] [2025-03-17 13:41:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:15,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:41:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:41:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:16,398 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-17 13:41:16,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799996448] [2025-03-17 13:41:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799996448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478856694] [2025-03-17 13:41:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:16,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:41:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:41:16,400 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-17 13:41:16,402 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-17 13:41:16,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:41:16,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:41:16,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:16,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:16,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 13:41:16,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:41:16,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:41:16,690 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-17 13:41:16,694 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-17 13:41:16,712 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-17 13:41:16,716 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-17 13:41:16,771 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-17 13:41:16,774 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-17 13:41:16,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:16,844 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-17 13:41:16,849 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-17 13:41:16,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:16,907 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-17 13:41:16,911 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-17 13:41:16,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:16,950 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-17 13:41:16,954 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-17 13:41:17,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:17,002 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-17 13:41:17,007 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-17 13:41:17,021 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-17 13:41:17,026 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-17 13:41:17,046 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-17 13:41:17,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:41:17,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2006 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-17 13:41:17,113 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2006 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:41:17,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2004) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2004) .cse1 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:41:17,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2003))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2002) .cse0 v_ArrVal_2004) .cse1 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2002) .cse5 v_ArrVal_2004) (select (select (store .cse6 .cse5 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2006))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-03-17 13:41:17,210 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2003))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) .cse2 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2001))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2002) .cse6 v_ArrVal_2004) (select (select (store .cse7 .cse6 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2006))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2025-03-17 13:41:17,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2012))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2003))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011) .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) .cse2 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2012))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2001))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011) .cse7 v_ArrVal_2002) .cse8 v_ArrVal_2004) (select (select (store .cse9 .cse8 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2006))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-17 13:41:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478856694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:17,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:41:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2025-03-17 13:41:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374769709] [2025-03-17 13:41:17,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:41:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:41:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:17,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:41:17,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=606, Unknown=9, NotChecked=330, Total=1056 [2025-03-17 13:41:17,260 INFO L87 Difference]: Start difference. First operand 1498 states and 1747 transitions. Second operand has 24 states, 21 states have (on average 6.0) internal successors, (126), 24 states have internal predecessors, (126), 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-17 13:41:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:22,125 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:41:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:41:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.0) internal successors, (126), 24 states have internal predecessors, (126), 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-17 13:41:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:22,128 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:41:22,128 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:41:22,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=957, Unknown=9, NotChecked=414, Total=1560 [2025-03-17 13:41:22,129 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 1527 mSDsluCounter, 9690 mSDsCounter, 0 mSdLazyCounter, 10202 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 10671 SdHoareTripleChecker+Invalid, 10230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 10202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:22,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 10671 Invalid, 10230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 10202 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 13:41:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:41:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1482. [2025-03-17 13:41:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1011 states have (on average 1.6874381800197824) internal successors, (1706), 1471 states have internal predecessors, (1706), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:41:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1730 transitions. [2025-03-17 13:41:22,139 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1730 transitions. Word has length 92 [2025-03-17 13:41:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:22,139 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1730 transitions. [2025-03-17 13:41:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.0) internal successors, (126), 24 states have internal predecessors, (126), 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-17 13:41:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1730 transitions. [2025-03-17 13:41:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:41:22,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:22,140 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-17 13:41:22,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 13:41:22,340 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,SelfDestructingSolverStorable28 [2025-03-17 13:41:22,341 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash 517851308, now seen corresponding path program 1 times [2025-03-17 13:41:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805842476] [2025-03-17 13:41:22,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:41:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:41:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:22,822 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-17 13:41:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805842476] [2025-03-17 13:41:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805842476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:41:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:41:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 13:41:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36983647] [2025-03-17 13:41:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:41:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:41:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:22,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:41:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:41:22,823 INFO L87 Difference]: Start difference. First operand 1482 states and 1730 transitions. Second operand has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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-17 13:41:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:25,282 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-03-17 13:41:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:41:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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 95 [2025-03-17 13:41:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:25,285 INFO L225 Difference]: With dead ends: 1505 [2025-03-17 13:41:25,285 INFO L226 Difference]: Without dead ends: 1505 [2025-03-17 13:41:25,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-17 13:41:25,285 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 1544 mSDsluCounter, 7622 mSDsCounter, 0 mSdLazyCounter, 5894 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8597 SdHoareTripleChecker+Invalid, 5923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:25,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8597 Invalid, 5923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5894 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 13:41:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-17 13:41:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1501. [2025-03-17 13:41:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1029 states have (on average 1.6773566569484937) internal successors, (1726), 1489 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1751 transitions. [2025-03-17 13:41:25,296 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1751 transitions. Word has length 95 [2025-03-17 13:41:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1751 transitions. [2025-03-17 13:41:25,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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-17 13:41:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1751 transitions. [2025-03-17 13:41:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:41:25,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:25,297 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-17 13:41:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 13:41:25,297 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:25,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash 517851309, now seen corresponding path program 1 times [2025-03-17 13:41:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:25,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016823708] [2025-03-17 13:41:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:41:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:41:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:26,058 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-17 13:41:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016823708] [2025-03-17 13:41:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016823708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:41:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:41:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:41:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334756975] [2025-03-17 13:41:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:41:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:41:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:26,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:41:26,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:41:26,059 INFO L87 Difference]: Start difference. First operand 1501 states and 1751 transitions. Second operand has 16 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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-17 13:41:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:30,584 INFO L93 Difference]: Finished difference Result 1504 states and 1758 transitions. [2025-03-17 13:41:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:41:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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 95 [2025-03-17 13:41:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:30,586 INFO L225 Difference]: With dead ends: 1504 [2025-03-17 13:41:30,586 INFO L226 Difference]: Without dead ends: 1504 [2025-03-17 13:41:30,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:41:30,586 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 1538 mSDsluCounter, 11514 mSDsCounter, 0 mSdLazyCounter, 9948 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 12496 SdHoareTripleChecker+Invalid, 9977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:30,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 12496 Invalid, 9977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 9948 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 13:41:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-03-17 13:41:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1501. [2025-03-17 13:41:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1029 states have (on average 1.6763848396501457) internal successors, (1725), 1489 states have internal predecessors, (1725), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1750 transitions. [2025-03-17 13:41:30,595 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1750 transitions. Word has length 95 [2025-03-17 13:41:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:30,595 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1750 transitions. [2025-03-17 13:41:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 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-17 13:41:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1750 transitions. [2025-03-17 13:41:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:41:30,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:30,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:41:30,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 13:41:30,596 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:41:30,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:41:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1800016496, now seen corresponding path program 1 times [2025-03-17 13:41:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:41:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980099940] [2025-03-17 13:41:30,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:41:30,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:41:30,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:41:30,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:30,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:31,133 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-17 13:41:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:41:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980099940] [2025-03-17 13:41:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980099940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745126191] [2025-03-17 13:41:31,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:41:31,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:41:31,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:41:31,135 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-17 13:41:31,137 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-17 13:41:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:41:31,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:41:31,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:41:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:41:31,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 13:41:31,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:41:31,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:41:31,411 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-17 13:41:31,415 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-17 13:41:31,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:31,451 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-17 13:41:31,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:31,473 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-17 13:41:31,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:31,511 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-17 13:41:31,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:31,543 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-17 13:41:31,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:41:31,576 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-17 13:41:31,583 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-17 13:41:31,597 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:41:31,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 13:41:31,599 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-17 13:41:31,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:41:32,092 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-17 13:41:32,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-03-17 13:41:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745126191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:41:32,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:41:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 20 [2025-03-17 13:41:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081614547] [2025-03-17 13:41:32,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:41:32,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:41:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:41:32,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:41:32,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=801, Unknown=54, NotChecked=0, Total=992 [2025-03-17 13:41:32,186 INFO L87 Difference]: Start difference. First operand 1501 states and 1750 transitions. Second operand has 21 states, 19 states have (on average 6.052631578947368) internal successors, (115), 20 states have internal predecessors, (115), 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-17 13:41:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:41:35,272 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-03-17 13:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:41:35,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.052631578947368) internal successors, (115), 20 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-17 13:41:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:41:35,274 INFO L225 Difference]: With dead ends: 1503 [2025-03-17 13:41:35,274 INFO L226 Difference]: Without dead ends: 1503 [2025-03-17 13:41:35,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=1410, Unknown=54, NotChecked=0, Total=1722 [2025-03-17 13:41:35,275 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 1522 mSDsluCounter, 9531 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:41:35,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 10506 Invalid, 7200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 13:41:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-17 13:41:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1500. [2025-03-17 13:41:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1029 states have (on average 1.6754130223517978) internal successors, (1724), 1488 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:41:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1749 transitions. [2025-03-17 13:41:35,290 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1749 transitions. Word has length 96 [2025-03-17 13:41:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:41:35,290 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1749 transitions. [2025-03-17 13:41:35,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.052631578947368) internal successors, (115), 20 states have internal predecessors, (115), 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-17 13:41:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1749 transitions. [2025-03-17 13:41:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:41:35,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:41:35,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:41:35,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0