./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-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_SFH_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:54:36,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:54:36,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:54:36,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:54:36,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:54:36,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:54:36,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:54:36,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:54:36,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:54:36,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:54:36,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:54:36,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:54:36,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:54:36,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:54:36,326 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:54:36,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:54:36,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:54:36,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:54:36,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:54:36,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:54:36,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:54:36,329 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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2025-03-17 13:54:36,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:54:36,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:54:36,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:54:36,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:54:36,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:54:36,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2025-03-17 13:54:37,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f72cdc0/5f9b93036e5a4e43a1a1fdf2cea85c01/FLAGf6172255e [2025-03-17 13:54:37,956 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:54:37,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2025-03-17 13:54:37,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f72cdc0/5f9b93036e5a4e43a1a1fdf2cea85c01/FLAGf6172255e [2025-03-17 13:54:38,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f72cdc0/5f9b93036e5a4e43a1a1fdf2cea85c01 [2025-03-17 13:54:38,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:54:38,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:54:38,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:54:38,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:54:38,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:54:38,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16745eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38, skipping insertion in model container [2025-03-17 13:54:38,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:54:38,478 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:54:38,507 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:54:38,511 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:54:38,516 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:54:38,522 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:54:38,545 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:54:38,545 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:54:38,546 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:54:38,547 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:54:38,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:54:38,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:54:38,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:54:38,663 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:54:38,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38 WrapperNode [2025-03-17 13:54:38,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:54:38,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:54:38,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:54:38,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:54:38,669 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:54:38" (1/1) ... [2025-03-17 13:54:38,687 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:54:38" (1/1) ... [2025-03-17 13:54:38,728 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-03-17 13:54:38,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:54:38,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:54:38,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:54:38,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:54:38,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,796 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-17 13:54:38,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:54:38,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:54:38,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:54:38,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:54:38,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (1/1) ... [2025-03-17 13:54:38,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:54:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:38,888 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:54:38,890 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:54:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 13:54:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 13:54:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:54:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:54:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 13:54:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:54:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:54:38,907 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:54:38,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:54:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:54:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:54:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:54:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:54:38,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:54:39,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:54:39,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:54:40,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 13:54:40,488 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-03-17 13:54:40,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:54:40,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:54:40,539 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 13:54:40,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:40 BoogieIcfgContainer [2025-03-17 13:54:40,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:54:40,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:54:40,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:54:40,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:54:40,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:54:38" (1/3) ... [2025-03-17 13:54:40,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c684faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:40, skipping insertion in model container [2025-03-17 13:54:40,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:54:38" (2/3) ... [2025-03-17 13:54:40,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c684faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:54:40, skipping insertion in model container [2025-03-17 13:54:40,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:54:40" (3/3) ... [2025-03-17 13:54:40,549 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2025-03-17 13:54:40,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:54:40,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test2-1.i that has 6 procedures, 1079 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2025-03-17 13:54:40,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:54:40,617 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;@3c8f317c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:54:40,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-03-17 13:54:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 1069 states, 634 states have (on average 2.0173501577287065) internal successors, (1279), 1062 states have internal predecessors, (1279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 13:54:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:54:40,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:40,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:54:40,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash 44159, now seen corresponding path program 1 times [2025-03-17 13:54:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58231501] [2025-03-17 13:54:40,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:40,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:54:40,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:54:40,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:40,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:40,778 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:54:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:40,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58231501] [2025-03-17 13:54:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58231501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:40,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:40,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:54:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540591511] [2025-03-17 13:54:40,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:40,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:40,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:40,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:40,810 INFO L87 Difference]: Start difference. First operand has 1069 states, 634 states have (on average 2.0173501577287065) internal successors, (1279), 1062 states have internal predecessors, (1279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:54:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:41,353 INFO L93 Difference]: Finished difference Result 1055 states and 1229 transitions. [2025-03-17 13:54:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:41,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 13:54:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:41,371 INFO L225 Difference]: With dead ends: 1055 [2025-03-17 13:54:41,371 INFO L226 Difference]: Without dead ends: 1053 [2025-03-17 13:54:41,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:54:41,376 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1095 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:41,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 851 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-17 13:54:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2025-03-17 13:54:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 636 states have (on average 1.900943396226415) internal successors, (1209), 1046 states have internal predecessors, (1209), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1227 transitions. [2025-03-17 13:54:41,439 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1227 transitions. Word has length 2 [2025-03-17 13:54:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1227 transitions. [2025-03-17 13:54:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:54:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1227 transitions. [2025-03-17 13:54:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:54:41,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:41,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:54:41,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:54:41,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:41,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 44160, now seen corresponding path program 1 times [2025-03-17 13:54:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567935981] [2025-03-17 13:54:41,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:41,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:54:41,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:54:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:41,515 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:54:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567935981] [2025-03-17 13:54:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567935981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:54:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681360725] [2025-03-17 13:54:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:41,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:41,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:41,516 INFO L87 Difference]: Start difference. First operand 1053 states and 1227 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:54:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:42,046 INFO L93 Difference]: Finished difference Result 1137 states and 1316 transitions. [2025-03-17 13:54:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 13:54:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:42,050 INFO L225 Difference]: With dead ends: 1137 [2025-03-17 13:54:42,050 INFO L226 Difference]: Without dead ends: 1137 [2025-03-17 13:54:42,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:54:42,051 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 837 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:42,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1161 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-17 13:54:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1089. [2025-03-17 13:54:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 682 states have (on average 1.8914956011730206) internal successors, (1290), 1082 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1308 transitions. [2025-03-17 13:54:42,078 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1308 transitions. Word has length 2 [2025-03-17 13:54:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:42,079 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1308 transitions. [2025-03-17 13:54:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:54:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1308 transitions. [2025-03-17 13:54:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 13:54:42,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:42,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 13:54:42,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:54:42,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2127490853, now seen corresponding path program 1 times [2025-03-17 13:54:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:42,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234082573] [2025-03-17 13:54:42,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:42,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 13:54:42,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 13:54:42,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:42,246 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:54:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234082573] [2025-03-17 13:54:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234082573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:42,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:42,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190280120] [2025-03-17 13:54:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:54:42,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:42,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:54:42,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:54:42,248 INFO L87 Difference]: Start difference. First operand 1089 states and 1308 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:43,216 INFO L93 Difference]: Finished difference Result 1404 states and 1710 transitions. [2025-03-17 13:54:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:54:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-17 13:54:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:43,221 INFO L225 Difference]: With dead ends: 1404 [2025-03-17 13:54:43,221 INFO L226 Difference]: Without dead ends: 1404 [2025-03-17 13:54:43,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:54:43,224 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 2210 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:43,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 1118 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:54:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-17 13:54:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1041. [2025-03-17 13:54:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 636 states have (on average 1.880503144654088) internal successors, (1196), 1034 states have internal predecessors, (1196), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1214 transitions. [2025-03-17 13:54:43,247 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1214 transitions. Word has length 6 [2025-03-17 13:54:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:43,248 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1214 transitions. [2025-03-17 13:54:43,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1214 transitions. [2025-03-17 13:54:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:54:43,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:43,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:54:43,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1527705733, now seen corresponding path program 1 times [2025-03-17 13:54:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005086762] [2025-03-17 13:54:43,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:54:43,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:54:43,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:43,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:43,306 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:54:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005086762] [2025-03-17 13:54:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005086762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037190281] [2025-03-17 13:54:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:43,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:43,307 INFO L87 Difference]: Start difference. First operand 1041 states and 1214 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:43,808 INFO L93 Difference]: Finished difference Result 1311 states and 1572 transitions. [2025-03-17 13:54:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 13:54:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:43,813 INFO L225 Difference]: With dead ends: 1311 [2025-03-17 13:54:43,813 INFO L226 Difference]: Without dead ends: 1311 [2025-03-17 13:54:43,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:43,814 INFO L435 NwaCegarLoop]: 1095 mSDtfsCounter, 1069 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:43,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1398 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-03-17 13:54:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 994. [2025-03-17 13:54:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 636 states have (on average 1.8066037735849056) internal successors, (1149), 987 states have internal predecessors, (1149), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1167 transitions. [2025-03-17 13:54:43,834 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1167 transitions. Word has length 7 [2025-03-17 13:54:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:43,834 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1167 transitions. [2025-03-17 13:54:43,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1167 transitions. [2025-03-17 13:54:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 13:54:43,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:43,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:43,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:54:43,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1527705732, now seen corresponding path program 1 times [2025-03-17 13:54:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511656233] [2025-03-17 13:54:43,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:43,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 13:54:43,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 13:54:43,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:43,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511656233] [2025-03-17 13:54:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511656233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979545993] [2025-03-17 13:54:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:43,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:43,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:43,911 INFO L87 Difference]: Start difference. First operand 994 states and 1167 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:44,424 INFO L93 Difference]: Finished difference Result 1291 states and 1551 transitions. [2025-03-17 13:54:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 13:54:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:44,428 INFO L225 Difference]: With dead ends: 1291 [2025-03-17 13:54:44,428 INFO L226 Difference]: Without dead ends: 1291 [2025-03-17 13:54:44,429 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:54:44,429 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 862 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:44,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1646 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-17 13:54:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2025-03-17 13:54:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 636 states have (on average 1.7672955974842768) internal successors, (1124), 962 states have internal predecessors, (1124), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1142 transitions. [2025-03-17 13:54:44,459 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1142 transitions. Word has length 7 [2025-03-17 13:54:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:44,459 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1142 transitions. [2025-03-17 13:54:44,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:54:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1142 transitions. [2025-03-17 13:54:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:54:44,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:44,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:44,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:54:44,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:44,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -91879294, now seen corresponding path program 1 times [2025-03-17 13:54:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:44,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957820834] [2025-03-17 13:54:44,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:54:44,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:54:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957820834] [2025-03-17 13:54:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957820834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648705182] [2025-03-17 13:54:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:44,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:44,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:44,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:44,514 INFO L87 Difference]: Start difference. First operand 969 states and 1142 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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:54:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:44,710 INFO L93 Difference]: Finished difference Result 1917 states and 2265 transitions. [2025-03-17 13:54:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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:54:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:44,716 INFO L225 Difference]: With dead ends: 1917 [2025-03-17 13:54:44,716 INFO L226 Difference]: Without dead ends: 1917 [2025-03-17 13:54:44,716 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:54:44,717 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 1094 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:44,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 3156 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:54:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-17 13:54:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 971. [2025-03-17 13:54:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 638 states have (on average 1.7648902821316614) internal successors, (1126), 964 states have internal predecessors, (1126), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1144 transitions. [2025-03-17 13:54:44,735 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1144 transitions. Word has length 9 [2025-03-17 13:54:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:44,735 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1144 transitions. [2025-03-17 13:54:44,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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:54:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1144 transitions. [2025-03-17 13:54:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 13:54:44,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:44,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:54:44,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:44,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2037349265, now seen corresponding path program 1 times [2025-03-17 13:54:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984271191] [2025-03-17 13:54:44,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:44,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:54:44,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:54:44,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:44,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:44,805 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:54:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984271191] [2025-03-17 13:54:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984271191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297953391] [2025-03-17 13:54:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:44,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:44,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:44,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:44,806 INFO L87 Difference]: Start difference. First operand 971 states and 1144 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:54:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:45,282 INFO L93 Difference]: Finished difference Result 997 states and 1197 transitions. [2025-03-17 13:54:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-17 13:54:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:45,285 INFO L225 Difference]: With dead ends: 997 [2025-03-17 13:54:45,285 INFO L226 Difference]: Without dead ends: 997 [2025-03-17 13:54:45,285 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:54:45,286 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1334 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:45,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1251 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-03-17 13:54:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 948. [2025-03-17 13:54:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 638 states have (on average 1.7288401253918495) internal successors, (1103), 941 states have internal predecessors, (1103), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1121 transitions. [2025-03-17 13:54:45,297 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1121 transitions. Word has length 16 [2025-03-17 13:54:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:45,297 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1121 transitions. [2025-03-17 13:54:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:54:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1121 transitions. [2025-03-17 13:54:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 13:54:45,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:45,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:54:45,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2037349264, now seen corresponding path program 1 times [2025-03-17 13:54:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475162080] [2025-03-17 13:54:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:45,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:54:45,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:54:45,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:45,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:45,356 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:54:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475162080] [2025-03-17 13:54:45,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475162080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:45,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16275262] [2025-03-17 13:54:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:45,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:45,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:45,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:45,357 INFO L87 Difference]: Start difference. First operand 948 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:54:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:45,403 INFO L93 Difference]: Finished difference Result 873 states and 1018 transitions. [2025-03-17 13:54:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-17 13:54:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:45,405 INFO L225 Difference]: With dead ends: 873 [2025-03-17 13:54:45,405 INFO L226 Difference]: Without dead ends: 873 [2025-03-17 13:54:45,405 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:54:45,406 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 60 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:45,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1877 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:54:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-17 13:54:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-03-17 13:54:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 575 states have (on average 1.7391304347826086) internal successors, (1000), 866 states have internal predecessors, (1000), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1018 transitions. [2025-03-17 13:54:45,415 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1018 transitions. Word has length 16 [2025-03-17 13:54:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:45,415 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1018 transitions. [2025-03-17 13:54:45,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:54:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1018 transitions. [2025-03-17 13:54:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:54:45,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:45,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:54:45,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:54:45,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1266558418, now seen corresponding path program 1 times [2025-03-17 13:54:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185649433] [2025-03-17 13:54:45,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:45,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:54:45,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:54:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:54:45,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185649433] [2025-03-17 13:54:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185649433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:45,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818051390] [2025-03-17 13:54:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:45,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:45,467 INFO L87 Difference]: Start difference. First operand 873 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:54:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:45,549 INFO L93 Difference]: Finished difference Result 855 states and 993 transitions. [2025-03-17 13:54:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-17 13:54:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:45,551 INFO L225 Difference]: With dead ends: 855 [2025-03-17 13:54:45,551 INFO L226 Difference]: Without dead ends: 855 [2025-03-17 13:54:45,551 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:54:45,554 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 41 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:45,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2762 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:54:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-17 13:54:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 852. [2025-03-17 13:54:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 561 states have (on average 1.732620320855615) internal successors, (972), 845 states have internal predecessors, (972), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 990 transitions. [2025-03-17 13:54:45,580 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 990 transitions. Word has length 17 [2025-03-17 13:54:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:45,580 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 990 transitions. [2025-03-17 13:54:45,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:54:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 990 transitions. [2025-03-17 13:54:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 13:54:45,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:45,581 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] [2025-03-17 13:54:45,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:54:45,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 489064584, now seen corresponding path program 1 times [2025-03-17 13:54:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687189613] [2025-03-17 13:54:45,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:45,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 13:54:45,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 13:54:45,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:45,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:45,721 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:54:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687189613] [2025-03-17 13:54:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687189613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:54:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318274080] [2025-03-17 13:54:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:45,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:45,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:45,723 INFO L87 Difference]: Start difference. First operand 852 states and 990 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:54:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:46,276 INFO L93 Difference]: Finished difference Result 1219 states and 1471 transitions. [2025-03-17 13:54:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:54:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 13:54:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:46,279 INFO L225 Difference]: With dead ends: 1219 [2025-03-17 13:54:46,280 INFO L226 Difference]: Without dead ends: 1219 [2025-03-17 13:54:46,280 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:54:46,280 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 864 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:46,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1707 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-17 13:54:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 848. [2025-03-17 13:54:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 561 states have (on average 1.7254901960784315) internal successors, (968), 841 states have internal predecessors, (968), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 986 transitions. [2025-03-17 13:54:46,292 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 986 transitions. Word has length 31 [2025-03-17 13:54:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 986 transitions. [2025-03-17 13:54:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:54:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 986 transitions. [2025-03-17 13:54:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 13:54:46,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:46,293 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] [2025-03-17 13:54:46,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:54:46,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr356REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:46,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1833878531, now seen corresponding path program 1 times [2025-03-17 13:54:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:46,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624496323] [2025-03-17 13:54:46,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 13:54:46,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 13:54:46,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:46,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:46,362 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:54:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:46,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624496323] [2025-03-17 13:54:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624496323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:46,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209751630] [2025-03-17 13:54:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:46,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:54:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:46,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:54:46,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:54:46,365 INFO L87 Difference]: Start difference. First operand 848 states and 986 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:54:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:46,444 INFO L93 Difference]: Finished difference Result 848 states and 982 transitions. [2025-03-17 13:54:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:54:46,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-17 13:54:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:46,446 INFO L225 Difference]: With dead ends: 848 [2025-03-17 13:54:46,446 INFO L226 Difference]: Without dead ends: 848 [2025-03-17 13:54:46,446 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:54:46,446 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:46,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2744 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:54:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-17 13:54:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-03-17 13:54:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 561 states have (on average 1.7183600713012477) internal successors, (964), 841 states have internal predecessors, (964), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 13:54:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 982 transitions. [2025-03-17 13:54:46,456 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 982 transitions. Word has length 65 [2025-03-17 13:54:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 982 transitions. [2025-03-17 13:54:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:54:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 982 transitions. [2025-03-17 13:54:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 13:54:46,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:46,457 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] [2025-03-17 13:54:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:54:46,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr356REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 103222725, now seen corresponding path program 1 times [2025-03-17 13:54:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377819657] [2025-03-17 13:54:46,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 13:54:46,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 13:54:46,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:46,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:46,586 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:54:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377819657] [2025-03-17 13:54:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377819657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:54:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488263970] [2025-03-17 13:54:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:46,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:54:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:46,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:54:46,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:54:46,590 INFO L87 Difference]: Start difference. First operand 848 states and 982 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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:54:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:46,695 INFO L93 Difference]: Finished difference Result 1182 states and 1420 transitions. [2025-03-17 13:54:46,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:54:46,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-17 13:54:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:46,698 INFO L225 Difference]: With dead ends: 1182 [2025-03-17 13:54:46,699 INFO L226 Difference]: Without dead ends: 1182 [2025-03-17 13:54:46,699 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:54:46,699 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 358 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:46,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2094 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:54:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-17 13:54:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1128. [2025-03-17 13:54:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 836 states have (on average 1.6614832535885167) internal successors, (1389), 1121 states have internal predecessors, (1389), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:54:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1417 transitions. [2025-03-17 13:54:46,720 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1417 transitions. Word has length 73 [2025-03-17 13:54:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:46,721 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1417 transitions. [2025-03-17 13:54:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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:54:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1417 transitions. [2025-03-17 13:54:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 13:54:46,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:46,724 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] [2025-03-17 13:54:46,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:54:46,724 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -90887984, now seen corresponding path program 1 times [2025-03-17 13:54:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623331427] [2025-03-17 13:54:46,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:46,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 13:54:46,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 13:54:46,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:46,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:46,936 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:54:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623331427] [2025-03-17 13:54:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623331427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072999047] [2025-03-17 13:54:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:54:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:46,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:54:46,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:54:46,937 INFO L87 Difference]: Start difference. First operand 1128 states and 1417 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:54:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:47,462 INFO L93 Difference]: Finished difference Result 1127 states and 1416 transitions. [2025-03-17 13:54:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-17 13:54:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:47,465 INFO L225 Difference]: With dead ends: 1127 [2025-03-17 13:54:47,465 INFO L226 Difference]: Without dead ends: 1127 [2025-03-17 13:54:47,465 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:54:47,465 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 2 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:47,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2752 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-17 13:54:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2025-03-17 13:54:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 836 states have (on average 1.6602870813397128) internal successors, (1388), 1120 states have internal predecessors, (1388), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:54:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1416 transitions. [2025-03-17 13:54:47,477 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1416 transitions. Word has length 81 [2025-03-17 13:54:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:47,478 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1416 transitions. [2025-03-17 13:54:47,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:54:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1416 transitions. [2025-03-17 13:54:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 13:54:47,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:47,478 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] [2025-03-17 13:54:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:54:47,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash -90887983, now seen corresponding path program 1 times [2025-03-17 13:54:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958133676] [2025-03-17 13:54:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 13:54:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 13:54:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:47,815 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:54:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958133676] [2025-03-17 13:54:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958133676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:54:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355090001] [2025-03-17 13:54:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:47,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:54:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:47,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:54:47,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:54:47,817 INFO L87 Difference]: Start difference. First operand 1127 states and 1416 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:54:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:48,380 INFO L93 Difference]: Finished difference Result 1126 states and 1415 transitions. [2025-03-17 13:54:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-17 13:54:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:48,383 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 13:54:48,383 INFO L226 Difference]: Without dead ends: 1126 [2025-03-17 13:54:48,383 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:54:48,383 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 1 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:48,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2723 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:54:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-03-17 13:54:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2025-03-17 13:54:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 835 states have (on average 1.6610778443113772) internal successors, (1387), 1119 states have internal predecessors, (1387), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:54:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1415 transitions. [2025-03-17 13:54:48,400 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1415 transitions. Word has length 81 [2025-03-17 13:54:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1415 transitions. [2025-03-17 13:54:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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:54:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1415 transitions. [2025-03-17 13:54:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:54:48,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:48,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, 1, 1, 1, 1, 1, 1, 1, 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:54:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:54:48,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1303735981, now seen corresponding path program 1 times [2025-03-17 13:54:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042626567] [2025-03-17 13:54:48,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:48,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:54:48,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:54:48,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:48,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:48,580 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:54:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042626567] [2025-03-17 13:54:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042626567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:54:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435279845] [2025-03-17 13:54:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:54:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:48,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:54:48,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:54:48,582 INFO L87 Difference]: Start difference. First operand 1126 states and 1415 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:54:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:49,364 INFO L93 Difference]: Finished difference Result 1138 states and 1430 transitions. [2025-03-17 13:54:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:54:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2025-03-17 13:54:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:49,367 INFO L225 Difference]: With dead ends: 1138 [2025-03-17 13:54:49,369 INFO L226 Difference]: Without dead ends: 1138 [2025-03-17 13:54:49,369 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:54:49,370 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 13 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4262 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:49,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4262 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:54:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-17 13:54:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1132. [2025-03-17 13:54:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 840 states have (on average 1.6595238095238096) internal successors, (1394), 1124 states have internal predecessors, (1394), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-17 13:54:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1425 transitions. [2025-03-17 13:54:49,385 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1425 transitions. Word has length 89 [2025-03-17 13:54:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1425 transitions. [2025-03-17 13:54:49,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:54:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1425 transitions. [2025-03-17 13:54:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:54:49,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:49,387 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:54:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:54:49,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1303735982, now seen corresponding path program 1 times [2025-03-17 13:54:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332688645] [2025-03-17 13:54:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:54:49,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:54:49,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:49,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:49,759 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:54:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332688645] [2025-03-17 13:54:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332688645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:54:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055437766] [2025-03-17 13:54:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:54:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:49,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:54:49,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:54:49,762 INFO L87 Difference]: Start difference. First operand 1132 states and 1425 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:54:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:50,498 INFO L93 Difference]: Finished difference Result 1132 states and 1424 transitions. [2025-03-17 13:54:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:54:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2025-03-17 13:54:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:50,501 INFO L225 Difference]: With dead ends: 1132 [2025-03-17 13:54:50,501 INFO L226 Difference]: Without dead ends: 1132 [2025-03-17 13:54:50,501 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:54:50,502 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 8 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:50,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3473 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:54:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-17 13:54:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2025-03-17 13:54:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 840 states have (on average 1.6583333333333334) internal successors, (1393), 1124 states have internal predecessors, (1393), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-17 13:54:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1424 transitions. [2025-03-17 13:54:50,516 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1424 transitions. Word has length 89 [2025-03-17 13:54:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:50,516 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1424 transitions. [2025-03-17 13:54:50,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:54:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1424 transitions. [2025-03-17 13:54:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:54:50,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:50,517 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] [2025-03-17 13:54:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:54:50,517 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:50,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -450719168, now seen corresponding path program 1 times [2025-03-17 13:54:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513427652] [2025-03-17 13:54:50,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:54:50,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:54:50,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:50,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:50,878 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:54:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513427652] [2025-03-17 13:54:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513427652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179578215] [2025-03-17 13:54:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:50,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:54:50,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:50,880 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:54:50,882 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:54:50,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:54:51,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:54:51,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:51,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:51,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 13:54:51,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:54:51,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:54:51,160 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:54:51,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:54:51,195 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:54:51,261 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:54:51,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:54:51,389 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:54:51,423 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:54:51,447 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:54:51,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:54:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179578215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:51,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:54:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-17 13:54:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325995485] [2025-03-17 13:54:51,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:54:51,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:54:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:51,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:54:51,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=318, Unknown=6, NotChecked=0, Total=380 [2025-03-17 13:54:51,495 INFO L87 Difference]: Start difference. First operand 1132 states and 1424 transitions. Second operand has 19 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 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:54:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:53,619 INFO L93 Difference]: Finished difference Result 1139 states and 1431 transitions. [2025-03-17 13:54:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:54:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 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 90 [2025-03-17 13:54:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:53,622 INFO L225 Difference]: With dead ends: 1139 [2025-03-17 13:54:53,622 INFO L226 Difference]: Without dead ends: 1139 [2025-03-17 13:54:53,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=462, Unknown=7, NotChecked=0, Total=552 [2025-03-17 13:54:53,623 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 871 mSDsluCounter, 6232 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 6819 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:53,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 6819 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:54:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-03-17 13:54:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1136. [2025-03-17 13:54:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 844 states have (on average 1.65521327014218) internal successors, (1397), 1127 states have internal predecessors, (1397), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:54:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1426 transitions. [2025-03-17 13:54:53,635 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1426 transitions. Word has length 90 [2025-03-17 13:54:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1426 transitions. [2025-03-17 13:54:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 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:54:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1426 transitions. [2025-03-17 13:54:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:54:53,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:53,635 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] [2025-03-17 13:54:53,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:54:53,840 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,SelfDestructingSolverStorable16 [2025-03-17 13:54:53,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:53,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash -450719167, now seen corresponding path program 1 times [2025-03-17 13:54:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:53,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366336255] [2025-03-17 13:54:53,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:53,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:54:53,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:54:53,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:53,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:54,328 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:54:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366336255] [2025-03-17 13:54:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366336255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914923855] [2025-03-17 13:54:54,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:54:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:54:54,332 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:54:54,332 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:54:54,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:54:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:54:54,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:54,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:54,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:54:54,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:54:54,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:54:54,591 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:54:54,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:54:54,597 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:54:54,606 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:54:54,609 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:54:54,653 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:54:54,657 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:54:54,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:54:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:54:54,745 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:54:54,764 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:54:54,769 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:54:54,771 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:54:54,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:54:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914923855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:54:54,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:54:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-17 13:54:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115515918] [2025-03-17 13:54:54,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:54:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:54:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:54,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:54:54,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=249, Unknown=5, NotChecked=0, Total=306 [2025-03-17 13:54:54,867 INFO L87 Difference]: Start difference. First operand 1136 states and 1426 transitions. Second operand has 15 states, 12 states have (on average 11.333333333333334) internal successors, (136), 15 states have internal predecessors, (136), 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:54:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:56,409 INFO L93 Difference]: Finished difference Result 1138 states and 1430 transitions. [2025-03-17 13:54:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:54:56,410 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.333333333333334) internal successors, (136), 15 states have internal predecessors, (136), 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 90 [2025-03-17 13:54:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:56,412 INFO L225 Difference]: With dead ends: 1138 [2025-03-17 13:54:56,412 INFO L226 Difference]: Without dead ends: 1138 [2025-03-17 13:54:56,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=376, Unknown=5, NotChecked=0, Total=462 [2025-03-17 13:54:56,413 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 871 mSDsluCounter, 3920 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:56,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 4510 Invalid, 4245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 13:54:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-17 13:54:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1129. [2025-03-17 13:54:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 839 states have (on average 1.6567342073897497) internal successors, (1390), 1121 states have internal predecessors, (1390), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:54:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1418 transitions. [2025-03-17 13:54:56,424 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1418 transitions. Word has length 90 [2025-03-17 13:54:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:56,424 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1418 transitions. [2025-03-17 13:54:56,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.333333333333334) internal successors, (136), 15 states have internal predecessors, (136), 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:54:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1418 transitions. [2025-03-17 13:54:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:54:56,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:56,425 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:54:56,432 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:54:56,625 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,SelfDestructingSolverStorable17 [2025-03-17 13:54:56,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:56,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 210248823, now seen corresponding path program 1 times [2025-03-17 13:54:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982394665] [2025-03-17 13:54:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:56,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:56,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:56,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:56,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:56,953 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:54:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982394665] [2025-03-17 13:54:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982394665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:54:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420865537] [2025-03-17 13:54:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:54:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:54:56,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:54:56,956 INFO L87 Difference]: Start difference. First operand 1129 states and 1418 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:54:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:54:58,168 INFO L93 Difference]: Finished difference Result 1142 states and 1434 transitions. [2025-03-17 13:54:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:54:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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 92 [2025-03-17 13:54:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:54:58,172 INFO L225 Difference]: With dead ends: 1142 [2025-03-17 13:54:58,172 INFO L226 Difference]: Without dead ends: 1142 [2025-03-17 13:54:58,172 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:54:58,172 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 878 mSDsluCounter, 4535 mSDsCounter, 0 mSdLazyCounter, 3632 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 5122 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:54:58,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 5122 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:54:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-17 13:54:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1138. [2025-03-17 13:54:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6528925619834711) internal successors, (1400), 1129 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:54:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1429 transitions. [2025-03-17 13:54:58,188 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1429 transitions. Word has length 92 [2025-03-17 13:54:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:54:58,188 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1429 transitions. [2025-03-17 13:54:58,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:54:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1429 transitions. [2025-03-17 13:54:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:54:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:54:58,189 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:54:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:54:58,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:54:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:54:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 210248824, now seen corresponding path program 1 times [2025-03-17 13:54:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:54:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207901453] [2025-03-17 13:54:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:54:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:54:58,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:54:58,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:54:58,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:54:58,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:54:58,616 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:54:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:54:58,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207901453] [2025-03-17 13:54:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207901453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:54:58,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:54:58,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:54:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900227755] [2025-03-17 13:54:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:54:58,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:54:58,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:54:58,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:54:58,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:54:58,618 INFO L87 Difference]: Start difference. First operand 1138 states and 1429 transitions. Second operand has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 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:55:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:00,063 INFO L93 Difference]: Finished difference Result 1141 states and 1433 transitions. [2025-03-17 13:55:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:55:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 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 92 [2025-03-17 13:55:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:00,069 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 13:55:00,069 INFO L226 Difference]: Without dead ends: 1141 [2025-03-17 13:55:00,069 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:55:00,072 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 893 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:00,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 3970 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:55:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-17 13:55:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1138. [2025-03-17 13:55:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6517119244391971) internal successors, (1399), 1129 states have internal predecessors, (1399), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1428 transitions. [2025-03-17 13:55:00,085 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1428 transitions. Word has length 92 [2025-03-17 13:55:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:00,085 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1428 transitions. [2025-03-17 13:55:00,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 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:55:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1428 transitions. [2025-03-17 13:55:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:55:00,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:00,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:55:00,086 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1306070012, now seen corresponding path program 1 times [2025-03-17 13:55:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665697165] [2025-03-17 13:55:00,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:00,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:55:00,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:55:00,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:00,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:00,491 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:55:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665697165] [2025-03-17 13:55:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665697165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380318842] [2025-03-17 13:55:00,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:00,494 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:55:00,496 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:55:00,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:55:00,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:55:00,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:00,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:00,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:55:00,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:00,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:00,769 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:00,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:55:00,793 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:55:00,855 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:55:00,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:00,952 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:55:01,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:01,013 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:55:01,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 13:55:01,053 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:55:01,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:01,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1021) |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:55:01,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:55:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380318842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:01,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-17 13:55:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303625877] [2025-03-17 13:55:01,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:55:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:01,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:55:01,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=421, Unknown=16, NotChecked=86, Total=600 [2025-03-17 13:55:01,120 INFO L87 Difference]: Start difference. First operand 1138 states and 1428 transitions. Second operand has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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:55:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:03,162 INFO L93 Difference]: Finished difference Result 1140 states and 1432 transitions. [2025-03-17 13:55:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:03,163 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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 93 [2025-03-17 13:55:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:03,166 INFO L225 Difference]: With dead ends: 1140 [2025-03-17 13:55:03,170 INFO L226 Difference]: Without dead ends: 1140 [2025-03-17 13:55:03,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=544, Unknown=16, NotChecked=98, Total=756 [2025-03-17 13:55:03,170 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 860 mSDsluCounter, 7873 mSDsCounter, 0 mSdLazyCounter, 5796 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 8459 SdHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:03,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 8459 Invalid, 5815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5796 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:55:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-17 13:55:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1137. [2025-03-17 13:55:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 847 states have (on average 1.6505312868949233) internal successors, (1398), 1128 states have internal predecessors, (1398), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1427 transitions. [2025-03-17 13:55:03,183 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1427 transitions. Word has length 93 [2025-03-17 13:55:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:03,183 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1427 transitions. [2025-03-17 13:55:03,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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:55:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1427 transitions. [2025-03-17 13:55:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:55:03,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:03,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:03,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 13:55:03,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:03,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1306070011, now seen corresponding path program 1 times [2025-03-17 13:55:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172805096] [2025-03-17 13:55:03,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:03,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:55:03,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:55:03,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:03,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:03,833 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:55:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172805096] [2025-03-17 13:55:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172805096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165942727] [2025-03-17 13:55:03,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:03,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:03,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:03,835 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:55:03,837 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:55:03,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:55:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:55:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:04,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:55:04,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:04,090 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:04,091 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:55:04,094 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:55:04,101 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:55:04,107 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:55:04,149 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:55:04,152 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:55:04,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:04,231 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:55:04,239 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:55:04,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:04,285 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:55:04,291 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:55:04,302 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:55:04,305 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:55:04,308 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:55:04,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:04,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1175 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:55:04,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1175 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:55:04,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1181))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1182) .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1182) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-17 13:55:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165942727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:04,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-17 13:55:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291574917] [2025-03-17 13:55:04,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:55:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:04,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:55:04,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-17 13:55:04,401 INFO L87 Difference]: Start difference. First operand 1137 states and 1427 transitions. Second operand has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:55:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:06,510 INFO L93 Difference]: Finished difference Result 1139 states and 1431 transitions. [2025-03-17 13:55:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:55:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-03-17 13:55:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:06,515 INFO L225 Difference]: With dead ends: 1139 [2025-03-17 13:55:06,515 INFO L226 Difference]: Without dead ends: 1139 [2025-03-17 13:55:06,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-17 13:55:06,516 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 867 mSDsluCounter, 4813 mSDsCounter, 0 mSdLazyCounter, 5183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 5402 SdHoareTripleChecker+Invalid, 5212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:06,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 5402 Invalid, 5212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5183 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:55:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-03-17 13:55:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1127. [2025-03-17 13:55:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 839 states have (on average 1.6543504171632897) internal successors, (1388), 1119 states have internal predecessors, (1388), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:55:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1416 transitions. [2025-03-17 13:55:06,527 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1416 transitions. Word has length 93 [2025-03-17 13:55:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:06,527 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1416 transitions. [2025-03-17 13:55:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.071428571428571) internal successors, (141), 17 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:55:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1416 transitions. [2025-03-17 13:55:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:55:06,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:06,528 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:55:06,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:06,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:06,728 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1461258054, now seen corresponding path program 1 times [2025-03-17 13:55:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280843009] [2025-03-17 13:55:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:06,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:06,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:06,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:07,008 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:55:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280843009] [2025-03-17 13:55:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280843009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:55:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601764892] [2025-03-17 13:55:07,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:07,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:55:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:07,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:55:07,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:55:07,011 INFO L87 Difference]: Start difference. First operand 1127 states and 1416 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:08,253 INFO L93 Difference]: Finished difference Result 1143 states and 1435 transitions. [2025-03-17 13:55:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:55:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:08,256 INFO L225 Difference]: With dead ends: 1143 [2025-03-17 13:55:08,256 INFO L226 Difference]: Without dead ends: 1143 [2025-03-17 13:55:08,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:55:08,257 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 882 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 5143 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:08,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 5143 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3567 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 13:55:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-17 13:55:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1139. [2025-03-17 13:55:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 850 states have (on average 1.648235294117647) internal successors, (1401), 1130 states have internal predecessors, (1401), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1430 transitions. [2025-03-17 13:55:08,267 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1430 transitions. Word has length 95 [2025-03-17 13:55:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1430 transitions. [2025-03-17 13:55:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1430 transitions. [2025-03-17 13:55:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:55:08,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:08,267 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:55:08,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:55:08,267 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:08,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1461258055, now seen corresponding path program 1 times [2025-03-17 13:55:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548590067] [2025-03-17 13:55:08,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:08,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:55:08,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:55:08,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:08,685 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:55:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548590067] [2025-03-17 13:55:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548590067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:55:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735417247] [2025-03-17 13:55:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:55:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:08,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:55:08,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:55:08,687 INFO L87 Difference]: Start difference. First operand 1139 states and 1430 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:10,137 INFO L93 Difference]: Finished difference Result 1142 states and 1434 transitions. [2025-03-17 13:55:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:55:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:10,139 INFO L225 Difference]: With dead ends: 1142 [2025-03-17 13:55:10,139 INFO L226 Difference]: Without dead ends: 1142 [2025-03-17 13:55:10,140 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:55:10,141 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 894 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 3971 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:55:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-17 13:55:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1139. [2025-03-17 13:55:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 850 states have (on average 1.6470588235294117) internal successors, (1400), 1130 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1429 transitions. [2025-03-17 13:55:10,157 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1429 transitions. Word has length 95 [2025-03-17 13:55:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:10,158 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1429 transitions. [2025-03-17 13:55:10,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 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:55:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1429 transitions. [2025-03-17 13:55:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:55:10,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:10,158 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:55:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 13:55:10,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1022103399, now seen corresponding path program 1 times [2025-03-17 13:55:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131062593] [2025-03-17 13:55:10,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:10,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:55:10,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:55:10,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:10,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:55:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131062593] [2025-03-17 13:55:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131062593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957006314] [2025-03-17 13:55:10,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:10,529 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:55:10,531 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:55:10,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:55:10,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:55:10,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:10,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:10,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 13:55:10,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:10,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:10,795 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:55:10,816 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:55:10,877 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:55:10,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:10,978 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:55:11,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:11,034 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:55:11,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:11,079 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:55:11,091 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:55:11,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:55:11,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:11,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1488) |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:55:11,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1487))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957006314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:11,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-17 13:55:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390109274] [2025-03-17 13:55:11,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:55:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:11,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:55:11,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=576, Unknown=28, NotChecked=102, Total=812 [2025-03-17 13:55:11,230 INFO L87 Difference]: Start difference. First operand 1139 states and 1429 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 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:55:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:13,454 INFO L93 Difference]: Finished difference Result 1141 states and 1433 transitions. [2025-03-17 13:55:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 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 96 [2025-03-17 13:55:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:13,458 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 13:55:13,458 INFO L226 Difference]: Without dead ends: 1141 [2025-03-17 13:55:13,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=721, Unknown=28, NotChecked=114, Total=992 [2025-03-17 13:55:13,458 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 849 mSDsluCounter, 8461 mSDsCounter, 0 mSdLazyCounter, 6395 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 9046 SdHoareTripleChecker+Invalid, 6415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:13,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 9046 Invalid, 6415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6395 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:55:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-17 13:55:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1138. [2025-03-17 13:55:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 850 states have (on average 1.6458823529411766) internal successors, (1399), 1129 states have internal predecessors, (1399), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1428 transitions. [2025-03-17 13:55:13,468 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1428 transitions. Word has length 96 [2025-03-17 13:55:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1428 transitions. [2025-03-17 13:55:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 23 states have internal predecessors, (154), 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:55:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1428 transitions. [2025-03-17 13:55:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:55:13,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:13,469 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:55:13,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:13,669 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,SelfDestructingSolverStorable24 [2025-03-17 13:55:13,669 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:13,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1022103398, now seen corresponding path program 1 times [2025-03-17 13:55:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478431160] [2025-03-17 13:55:13,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:13,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:13,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:55:13,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:55:13,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:13,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:14,175 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:55:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478431160] [2025-03-17 13:55:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478431160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177905472] [2025-03-17 13:55:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:14,177 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:55:14,179 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:55:14,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:55:14,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:55:14,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:14,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:55:14,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:14,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:14,465 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:55:14,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:14,470 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:55:14,502 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:55:14,505 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:55:14,573 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:55:14,577 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:55:14,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:14,644 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:55:14,651 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:55:14,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:14,699 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:55:14,710 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:55:14,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:14,750 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:55:14,756 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:55:14,767 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:55:14,769 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:55:14,785 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:55:14,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:14,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1656 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2025-03-17 13:55:14,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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1656 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:55:14,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1654))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1655) .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1655) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-03-17 13:55:14,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1655) .cse1 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1655) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-17 13:55:14,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1663))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1662) .cse0 v_ArrVal_1655) .cse1 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1663))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1662) .cse5 v_ArrVal_1655) (select (select (store .cse6 .cse5 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1656))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-17 13:55:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177905472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:14,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-17 13:55:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111161232] [2025-03-17 13:55:14,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:14,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:55:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:14,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:55:14,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-03-17 13:55:14,902 INFO L87 Difference]: Start difference. First operand 1138 states and 1428 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 22 states have internal predecessors, (154), 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:55:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:17,738 INFO L93 Difference]: Finished difference Result 1140 states and 1432 transitions. [2025-03-17 13:55:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:55:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 22 states have internal predecessors, (154), 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 96 [2025-03-17 13:55:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:17,740 INFO L225 Difference]: With dead ends: 1140 [2025-03-17 13:55:17,740 INFO L226 Difference]: Without dead ends: 1140 [2025-03-17 13:55:17,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2025-03-17 13:55:17,741 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 867 mSDsluCounter, 6065 mSDsCounter, 0 mSdLazyCounter, 6852 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 6653 SdHoareTripleChecker+Invalid, 6883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:17,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 6653 Invalid, 6883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6852 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 13:55:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-17 13:55:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1125. [2025-03-17 13:55:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 839 states have (on average 1.6519666269368296) internal successors, (1386), 1117 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:55:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1414 transitions. [2025-03-17 13:55:17,751 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1414 transitions. Word has length 96 [2025-03-17 13:55:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1414 transitions. [2025-03-17 13:55:17,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 22 states have internal predecessors, (154), 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:55:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1414 transitions. [2025-03-17 13:55:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 13:55:17,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:17,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 13:55:17,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 13:55:17,952 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1448942864, now seen corresponding path program 1 times [2025-03-17 13:55:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366957227] [2025-03-17 13:55:17,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:17,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:17,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:18,333 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:55:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366957227] [2025-03-17 13:55:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366957227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:55:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156030640] [2025-03-17 13:55:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:18,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:55:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:18,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:55:18,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:55:18,334 INFO L87 Difference]: Start difference. First operand 1125 states and 1414 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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:55:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:19,527 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2025-03-17 13:55:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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 98 [2025-03-17 13:55:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:19,530 INFO L225 Difference]: With dead ends: 1144 [2025-03-17 13:55:19,530 INFO L226 Difference]: Without dead ends: 1144 [2025-03-17 13:55:19,530 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:55:19,530 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 886 mSDsluCounter, 4504 mSDsCounter, 0 mSdLazyCounter, 3624 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 5089 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:19,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 5089 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:55:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-17 13:55:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1140. [2025-03-17 13:55:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 853 states have (on average 1.6436107854630715) internal successors, (1402), 1131 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1431 transitions. [2025-03-17 13:55:19,540 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1431 transitions. Word has length 98 [2025-03-17 13:55:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:19,540 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1431 transitions. [2025-03-17 13:55:19,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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:55:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1431 transitions. [2025-03-17 13:55:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 13:55:19,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:19,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:19,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:55:19,541 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1448942863, now seen corresponding path program 1 times [2025-03-17 13:55:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401303674] [2025-03-17 13:55:19,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 13:55:19,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 13:55:19,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:19,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:20,055 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:55:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401303674] [2025-03-17 13:55:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401303674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:20,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 13:55:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401937315] [2025-03-17 13:55:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:20,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:55:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:20,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:55:20,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:55:20,056 INFO L87 Difference]: Start difference. First operand 1140 states and 1431 transitions. Second operand has 13 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:21,598 INFO L93 Difference]: Finished difference Result 1143 states and 1435 transitions. [2025-03-17 13:55:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:55:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-03-17 13:55:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:21,601 INFO L225 Difference]: With dead ends: 1143 [2025-03-17 13:55:21,601 INFO L226 Difference]: Without dead ends: 1143 [2025-03-17 13:55:21,601 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:55:21,601 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 896 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:21,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 3970 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3772 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:55:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-17 13:55:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1140. [2025-03-17 13:55:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 853 states have (on average 1.6424384525205158) internal successors, (1401), 1131 states have internal predecessors, (1401), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1430 transitions. [2025-03-17 13:55:21,613 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1430 transitions. Word has length 98 [2025-03-17 13:55:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:21,613 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1430 transitions. [2025-03-17 13:55:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:55:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1430 transitions. [2025-03-17 13:55:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 13:55:21,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:21,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 13:55:21,614 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1836651709, now seen corresponding path program 1 times [2025-03-17 13:55:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387131314] [2025-03-17 13:55:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:21,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:55:21,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:55:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:22,039 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:55:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387131314] [2025-03-17 13:55:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387131314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710311980] [2025-03-17 13:55:22,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:22,042 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:55:22,044 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:55:22,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:55:22,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:55:22,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:22,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:22,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 13:55:22,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:22,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:22,319 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:22,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:55:22,337 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:55:22,384 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:55:22,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:22,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:55:22,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:22,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:55:22,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:22,570 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:55:22,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:22,609 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:55:22,618 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:55:22,646 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:55:22,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:22,654 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1994) |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:55:22,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:55:22,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1993))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:22,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1992))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1993)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:22,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1992))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1993)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:22,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1997))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1992)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1993)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1994)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710311980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:22,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-17 13:55:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307868503] [2025-03-17 13:55:22,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 13:55:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:22,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 13:55:22,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=597, Unknown=11, NotChecked=330, Total=1056 [2025-03-17 13:55:22,727 INFO L87 Difference]: Start difference. First operand 1140 states and 1430 transitions. Second operand has 26 states, 23 states have (on average 6.956521739130435) internal successors, (160), 25 states have internal predecessors, (160), 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:55:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:25,026 INFO L93 Difference]: Finished difference Result 1142 states and 1434 transitions. [2025-03-17 13:55:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:55:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.956521739130435) internal successors, (160), 25 states have internal predecessors, (160), 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 99 [2025-03-17 13:55:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:25,029 INFO L225 Difference]: With dead ends: 1142 [2025-03-17 13:55:25,029 INFO L226 Difference]: Without dead ends: 1142 [2025-03-17 13:55:25,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=743, Unknown=11, NotChecked=366, Total=1260 [2025-03-17 13:55:25,031 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 844 mSDsluCounter, 8414 mSDsCounter, 0 mSdLazyCounter, 6396 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 8998 SdHoareTripleChecker+Invalid, 6414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:25,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 8998 Invalid, 6414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6396 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:55:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-17 13:55:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1139. [2025-03-17 13:55:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 853 states have (on average 1.64126611957796) internal successors, (1400), 1130 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1429 transitions. [2025-03-17 13:55:25,039 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1429 transitions. Word has length 99 [2025-03-17 13:55:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:25,040 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1429 transitions. [2025-03-17 13:55:25,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.956521739130435) internal successors, (160), 25 states have internal predecessors, (160), 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:55:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1429 transitions. [2025-03-17 13:55:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 13:55:25,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:25,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:25,047 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:55:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:25,241 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1836651710, now seen corresponding path program 1 times [2025-03-17 13:55:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512745406] [2025-03-17 13:55:25,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:25,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:55:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:55:25,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:25,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:25,781 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:55:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512745406] [2025-03-17 13:55:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512745406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091601485] [2025-03-17 13:55:25,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:25,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:25,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:25,784 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:55:25,785 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:55:25,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:55:25,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:55:25,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:25,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:25,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 13:55:25,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:26,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:55:26,029 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:55:26,032 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:55:26,047 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:55:26,051 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:55:26,105 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:55:26,107 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:55:26,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:26,183 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:55:26,186 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:55:26,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:26,244 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:55:26,249 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:55:26,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:26,292 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:55:26,296 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:55:26,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:26,330 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:55:26,334 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:55:26,343 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:55:26,346 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:55:26,363 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:55:26,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:26,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2177 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-17 13:55:26,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2177 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:55:26,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2174) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 24 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:55:26,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2172))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2173) .cse0 v_ArrVal_2174) (select (select (store .cse1 .cse0 v_ArrVal_2175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2177))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2172))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2175))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2173) .cse3 v_ArrVal_2174) .cse4 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-17 13:55:26,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2172))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2175))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2173) .cse1 v_ArrVal_2174) .cse2 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2172))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2173) .cse6 v_ArrVal_2174) (select (select (store .cse7 .cse6 v_ArrVal_2175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2177))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-03-17 13:55:26,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2183 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2183))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2172))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2175))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2182) .cse0 v_ArrVal_2173) .cse1 v_ArrVal_2174) .cse2 v_ArrVal_2177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2183 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2183))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2172))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2182) .cse7 v_ArrVal_2173) .cse8 v_ArrVal_2174) (select (select (store .cse9 .cse8 v_ArrVal_2175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2177))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-17 13:55:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091601485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:26,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-17 13:55:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971322987] [2025-03-17 13:55:26,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:55:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:26,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:55:26,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=605, Unknown=11, NotChecked=330, Total=1056 [2025-03-17 13:55:26,579 INFO L87 Difference]: Start difference. First operand 1139 states and 1429 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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:55:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:28,752 INFO L93 Difference]: Finished difference Result 1141 states and 1433 transitions. [2025-03-17 13:55:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:55:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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 99 [2025-03-17 13:55:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:28,754 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 13:55:28,754 INFO L226 Difference]: Without dead ends: 1141 [2025-03-17 13:55:28,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=956, Unknown=11, NotChecked=414, Total=1560 [2025-03-17 13:55:28,755 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 869 mSDsluCounter, 5285 mSDsCounter, 0 mSdLazyCounter, 5745 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 5872 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:28,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 5872 Invalid, 5777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5745 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:55:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-17 13:55:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1123. [2025-03-17 13:55:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 839 states have (on average 1.6495828367103695) internal successors, (1384), 1115 states have internal predecessors, (1384), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:55:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1412 transitions. [2025-03-17 13:55:28,763 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1412 transitions. Word has length 99 [2025-03-17 13:55:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1412 transitions. [2025-03-17 13:55:28,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 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:55:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1412 transitions. [2025-03-17 13:55:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 13:55:28,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:28,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:28,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 13:55:28,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:28,964 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2009715798, now seen corresponding path program 1 times [2025-03-17 13:55:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443511381] [2025-03-17 13:55:28,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:28,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 13:55:28,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 13:55:28,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:28,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:29,404 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:55:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:29,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443511381] [2025-03-17 13:55:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443511381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:29,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:29,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 13:55:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34295360] [2025-03-17 13:55:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:55:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:29,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:55:29,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:55:29,405 INFO L87 Difference]: Start difference. First operand 1123 states and 1412 transitions. Second operand has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 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:55:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:30,945 INFO L93 Difference]: Finished difference Result 1146 states and 1438 transitions. [2025-03-17 13:55:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:55:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 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 102 [2025-03-17 13:55:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:30,947 INFO L225 Difference]: With dead ends: 1146 [2025-03-17 13:55:30,947 INFO L226 Difference]: Without dead ends: 1146 [2025-03-17 13:55:30,948 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:55:30,948 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 900 mSDsluCounter, 5642 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 6226 SdHoareTripleChecker+Invalid, 4428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:30,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 6226 Invalid, 4428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4407 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:55:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-17 13:55:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1142. [2025-03-17 13:55:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 857 states have (on average 1.6382730455075847) internal successors, (1404), 1133 states have internal predecessors, (1404), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1433 transitions. [2025-03-17 13:55:30,956 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1433 transitions. Word has length 102 [2025-03-17 13:55:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1433 transitions. [2025-03-17 13:55:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.666666666666667) internal successors, (100), 16 states have internal predecessors, (100), 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:55:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1433 transitions. [2025-03-17 13:55:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 13:55:30,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:30,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 13:55:30,957 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2009715797, now seen corresponding path program 1 times [2025-03-17 13:55:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681743843] [2025-03-17 13:55:30,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:30,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 13:55:30,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 13:55:30,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:30,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:31,589 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:55:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681743843] [2025-03-17 13:55:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681743843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:55:31,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:55:31,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 13:55:31,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447397531] [2025-03-17 13:55:31,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:55:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:55:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:31,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:55:31,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:55:31,590 INFO L87 Difference]: Start difference. First operand 1142 states and 1433 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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:55:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:33,863 INFO L93 Difference]: Finished difference Result 1145 states and 1437 transitions. [2025-03-17 13:55:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:55:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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 102 [2025-03-17 13:55:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:33,865 INFO L225 Difference]: With dead ends: 1145 [2025-03-17 13:55:33,866 INFO L226 Difference]: Without dead ends: 1145 [2025-03-17 13:55:33,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:55:33,866 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 880 mSDsluCounter, 5243 mSDsCounter, 0 mSdLazyCounter, 5750 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 5828 SdHoareTripleChecker+Invalid, 5772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:33,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 5828 Invalid, 5772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5750 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:55:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-17 13:55:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1142. [2025-03-17 13:55:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 857 states have (on average 1.6371061843640606) internal successors, (1403), 1133 states have internal predecessors, (1403), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1432 transitions. [2025-03-17 13:55:33,879 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1432 transitions. Word has length 102 [2025-03-17 13:55:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1432 transitions. [2025-03-17 13:55:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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:55:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1432 transitions. [2025-03-17 13:55:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 13:55:33,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:33,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:33,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 13:55:33,880 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 785690359, now seen corresponding path program 1 times [2025-03-17 13:55:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998294752] [2025-03-17 13:55:33,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:33,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 13:55:33,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 13:55:33,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:33,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:34,372 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:55:34,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998294752] [2025-03-17 13:55:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998294752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789088919] [2025-03-17 13:55:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:34,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:34,374 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:55:34,375 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:55:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 13:55:34,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 13:55:34,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:34,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 13:55:34,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:34,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:34,656 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:55:34,680 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:55:34,738 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:55:34,847 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:34,847 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:55:34,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:34,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:55:34,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:34,933 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:55:34,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:34,969 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:55:35,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:35,006 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:55:35,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 13:55:35,047 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-17 13:55:35,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-17 13:55:35,069 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:55:35,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:35,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2547 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2547) |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:55:35,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2547 (Array Int Int)) (v_ArrVal_2546 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2546))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2547)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:55:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789088919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:35,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-03-17 13:55:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521224187] [2025-03-17 13:55:35,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:35,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 13:55:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 13:55:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=923, Unknown=103, NotChecked=134, Total=1332 [2025-03-17 13:55:35,401 INFO L87 Difference]: Start difference. First operand 1142 states and 1432 transitions. Second operand has 28 states, 25 states have (on average 6.72) internal successors, (168), 27 states have internal predecessors, (168), 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:55:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:55:37,364 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2025-03-17 13:55:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:55:37,364 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.72) internal successors, (168), 27 states have internal predecessors, (168), 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 103 [2025-03-17 13:55:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:55:37,366 INFO L225 Difference]: With dead ends: 1144 [2025-03-17 13:55:37,366 INFO L226 Difference]: Without dead ends: 1144 [2025-03-17 13:55:37,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1114, Unknown=103, NotChecked=146, Total=1560 [2025-03-17 13:55:37,367 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 842 mSDsluCounter, 6777 mSDsCounter, 0 mSdLazyCounter, 5176 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 7360 SdHoareTripleChecker+Invalid, 5196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:55:37,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 7360 Invalid, 5196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5176 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:55:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-17 13:55:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1141. [2025-03-17 13:55:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 857 states have (on average 1.6359393232205368) internal successors, (1402), 1132 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 13:55:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1431 transitions. [2025-03-17 13:55:37,375 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1431 transitions. Word has length 103 [2025-03-17 13:55:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:55:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1431 transitions. [2025-03-17 13:55:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.72) internal successors, (168), 27 states have internal predecessors, (168), 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:55:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1431 transitions. [2025-03-17 13:55:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 13:55:37,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:55:37,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:55:37,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 13:55:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:37,576 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-17 13:55:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:55:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 785690360, now seen corresponding path program 1 times [2025-03-17 13:55:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:55:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886546589] [2025-03-17 13:55:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:55:37,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 13:55:37,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 13:55:37,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:37,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:38,281 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:55:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:55:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886546589] [2025-03-17 13:55:38,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886546589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201504628] [2025-03-17 13:55:38,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:55:38,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:55:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:55:38,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:55:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 13:55:38,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 13:55:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 13:55:38,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:55:38,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:55:38,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 13:55:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:55:38,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:55:38,546 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:55:38,555 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:55:38,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:55:38,583 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:55:38,586 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:55:38,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-17 13:55:38,660 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:55:38,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 13:55:38,769 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:55:38,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:38,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 13:55:38,844 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:55:38,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 13:55:38,903 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:55:38,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:38,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 13:55:38,969 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:55:39,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:55:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-17 13:55:39,035 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:55:39,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-03-17 13:55:39,059 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:55:39,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:55:39,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 13:55:39,114 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 13:55:39,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 13:55:39,138 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:55:39,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:55:39,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2746))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2745) .cse1 v_ArrVal_2747) (select (select (store .cse2 .cse1 v_ArrVal_2748) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2750))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2751 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2746))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2748))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2745) .cse4 v_ArrVal_2747) .cse5 v_ArrVal_2750) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2751) (select (select (store .cse6 .cse5 v_ArrVal_2749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-03-17 13:55:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201504628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:55:56,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:55:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-17 13:55:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159287167] [2025-03-17 13:55:56,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:55:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 13:55:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:55:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 13:55:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1407, Unknown=64, NotChecked=78, Total=1722 [2025-03-17 13:55:56,226 INFO L87 Difference]: Start difference. First operand 1141 states and 1431 transitions. Second operand has 30 states, 27 states have (on average 6.222222222222222) internal successors, (168), 29 states have internal predecessors, (168), 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)