./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_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-?-798a7b3-m [2025-03-04 09:38:17,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:38:17,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:38:17,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:38:17,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:38:17,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:38:17,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:38:17,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:38:17,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:38:17,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:38:17,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:38:17,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:38:17,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:38:17,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:38:17,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:38:17,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:38:17,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:38:17,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:38:17,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:38:17,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:38:17,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:38:17,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:38:17,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:38:17,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:38:17,305 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-04 09:38:17,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:38:17,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:38:17,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:38:17,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:38:17,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:38:17,553 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-04 09:38:18,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7202987/fc8e1b3864024e3787d58bf4d9df6fa4/FLAG82e6d4bc1 [2025-03-04 09:38:19,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:38:19,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2025-03-04 09:38:19,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7202987/fc8e1b3864024e3787d58bf4d9df6fa4/FLAG82e6d4bc1 [2025-03-04 09:38:19,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7202987/fc8e1b3864024e3787d58bf4d9df6fa4 [2025-03-04 09:38:19,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:38:19,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:38:19,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:38:19,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:38:19,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:38:19,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daa0f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19, skipping insertion in model container [2025-03-04 09:38:19,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:38:19,652 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,687 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,691 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,699 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,734 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,735 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:38:19,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:38:19,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:38:19,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:38:19,857 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:38:19,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19 WrapperNode [2025-03-04 09:38:19,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:38:19,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:38:19,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:38:19,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:38:19,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,926 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-03-04 09:38:19,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:38:19,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:38:19,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:38:19,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:38:19,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,992 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 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, 42, 4]. [2025-03-04 09:38:19,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:19,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:38:20,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:38:20,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:38:20,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:38:20,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (1/1) ... [2025-03-04 09:38:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:38:20,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:20,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:38:20,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:38:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:38:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:38:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:38:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:38:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:38:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:38:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:38:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:38:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:38:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:38:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:38:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 09:38:20,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:38:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:38:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:38:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:38:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:38:20,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:38:20,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:38:20,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:38:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:38:21,815 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-03-04 09:38:21,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:38:21,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:38:21,880 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:38:21,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:38:21 BoogieIcfgContainer [2025-03-04 09:38:21,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:38:21,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:38:21,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:38:21,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:38:21,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:38:19" (1/3) ... [2025-03-04 09:38:21,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc28c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:38:21, skipping insertion in model container [2025-03-04 09:38:21,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:38:19" (2/3) ... [2025-03-04 09:38:21,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc28c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:38:21, skipping insertion in model container [2025-03-04 09:38:21,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:38:21" (3/3) ... [2025-03-04 09:38:21,888 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2025-03-04 09:38:21,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:38:21,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test2-1.i that has 6 procedures, 1081 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2025-03-04 09:38:21,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:38:21,960 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;@dc7a872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:38:21,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-03-04 09:38:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 1071 states, 636 states have (on average 2.0141509433962264) internal successors, (1281), 1064 states have internal predecessors, (1281), 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-04 09:38:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:38:21,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:21,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:38:21,972 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-04 09:38:21,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1372293, now seen corresponding path program 1 times [2025-03-04 09:38:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147634676] [2025-03-04 09:38:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:22,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:38:22,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:38:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147634676] [2025-03-04 09:38:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147634676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:38:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599474908] [2025-03-04 09:38:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:22,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:22,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:22,160 INFO L87 Difference]: Start difference. First operand has 1071 states, 636 states have (on average 2.0141509433962264) internal successors, (1281), 1064 states have internal predecessors, (1281), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:22,727 INFO L93 Difference]: Finished difference Result 1057 states and 1231 transitions. [2025-03-04 09:38:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:38:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:22,745 INFO L225 Difference]: With dead ends: 1057 [2025-03-04 09:38:22,746 INFO L226 Difference]: Without dead ends: 1055 [2025-03-04 09:38:22,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:22,751 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 1096 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:22,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 853 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:38:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-04 09:38:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-03-04 09:38:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 638 states have (on average 1.8981191222570533) internal successors, (1211), 1048 states have internal predecessors, (1211), 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-04 09:38:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1229 transitions. [2025-03-04 09:38:22,831 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1229 transitions. Word has length 3 [2025-03-04 09:38:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1229 transitions. [2025-03-04 09:38:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1229 transitions. [2025-03-04 09:38:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:38:22,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:22,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:38:22,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:38:22,832 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-04 09:38:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1372294, now seen corresponding path program 1 times [2025-03-04 09:38:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247940020] [2025-03-04 09:38:22,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:22,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:38:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:38:22,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247940020] [2025-03-04 09:38:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247940020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:22,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:38:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757885342] [2025-03-04 09:38:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:22,925 INFO L87 Difference]: Start difference. First operand 1055 states and 1229 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:23,740 INFO L93 Difference]: Finished difference Result 1825 states and 2161 transitions. [2025-03-04 09:38:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:38:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:23,746 INFO L225 Difference]: With dead ends: 1825 [2025-03-04 09:38:23,747 INFO L226 Difference]: Without dead ends: 1825 [2025-03-04 09:38:23,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:23,747 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 914 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:23,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1652 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:38:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-03-04 09:38:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1561. [2025-03-04 09:38:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1140 states have (on average 1.8587719298245613) internal successors, (2119), 1552 states have internal predecessors, (2119), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2151 transitions. [2025-03-04 09:38:23,790 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2151 transitions. Word has length 3 [2025-03-04 09:38:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:23,790 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2151 transitions. [2025-03-04 09:38:23,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2151 transitions. [2025-03-04 09:38:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:38:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:23,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:23,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:38:23,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1523388682, now seen corresponding path program 1 times [2025-03-04 09:38:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863622504] [2025-03-04 09:38:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:23,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:38:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:38:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:23,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863622504] [2025-03-04 09:38:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863622504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:38:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053726381] [2025-03-04 09:38:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:23,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:23,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:23,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:23,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:23,883 INFO L87 Difference]: Start difference. First operand 1561 states and 2151 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:24,489 INFO L93 Difference]: Finished difference Result 1832 states and 2486 transitions. [2025-03-04 09:38:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:24,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-04 09:38:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:24,495 INFO L225 Difference]: With dead ends: 1832 [2025-03-04 09:38:24,495 INFO L226 Difference]: Without dead ends: 1832 [2025-03-04 09:38:24,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:24,496 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 1081 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:24,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1413 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:38:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-03-04 09:38:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1514. [2025-03-04 09:38:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1140 states have (on average 1.7964912280701755) internal successors, (2048), 1505 states have internal predecessors, (2048), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2080 transitions. [2025-03-04 09:38:24,529 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2080 transitions. Word has length 8 [2025-03-04 09:38:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2080 transitions. [2025-03-04 09:38:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2080 transitions. [2025-03-04 09:38:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:38:24,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:24,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:38:24,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1523388681, now seen corresponding path program 1 times [2025-03-04 09:38:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392162300] [2025-03-04 09:38:24,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:38:24,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:38:24,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:24,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392162300] [2025-03-04 09:38:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392162300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:38:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757281212] [2025-03-04 09:38:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:24,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:24,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:24,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:24,618 INFO L87 Difference]: Start difference. First operand 1514 states and 2080 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:25,219 INFO L93 Difference]: Finished difference Result 2050 states and 2852 transitions. [2025-03-04 09:38:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-04 09:38:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:25,225 INFO L225 Difference]: With dead ends: 2050 [2025-03-04 09:38:25,225 INFO L226 Difference]: Without dead ends: 2050 [2025-03-04 09:38:25,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:25,226 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 874 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:25,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1656 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:38:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-04 09:38:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1489. [2025-03-04 09:38:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1140 states have (on average 1.7535087719298246) internal successors, (1999), 1480 states have internal predecessors, (1999), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2031 transitions. [2025-03-04 09:38:25,251 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2031 transitions. Word has length 8 [2025-03-04 09:38:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 2031 transitions. [2025-03-04 09:38:25,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2031 transitions. [2025-03-04 09:38:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:38:25,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:25,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:25,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:38:25,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -238160579, now seen corresponding path program 1 times [2025-03-04 09:38:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019066571] [2025-03-04 09:38:25,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:25,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:38:25,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:38:25,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019066571] [2025-03-04 09:38:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019066571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:38:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806025062] [2025-03-04 09:38:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:25,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:38:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:38:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:38:25,345 INFO L87 Difference]: Start difference. First operand 1489 states and 2031 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:25,569 INFO L93 Difference]: Finished difference Result 2666 states and 3562 transitions. [2025-03-04 09:38:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:38:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 09:38:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:25,578 INFO L225 Difference]: With dead ends: 2666 [2025-03-04 09:38:25,578 INFO L226 Difference]: Without dead ends: 2666 [2025-03-04 09:38:25,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:25,583 INFO L435 NwaCegarLoop]: 1064 mSDtfsCounter, 1095 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:25,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 3172 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:38:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2025-03-04 09:38:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1491. [2025-03-04 09:38:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1142 states have (on average 1.7521891418563922) internal successors, (2001), 1482 states have internal predecessors, (2001), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2033 transitions. [2025-03-04 09:38:25,614 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2033 transitions. Word has length 10 [2025-03-04 09:38:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:25,615 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2033 transitions. [2025-03-04 09:38:25,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2033 transitions. [2025-03-04 09:38:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:38:25,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:25,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:25,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:38:25,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -888004907, now seen corresponding path program 1 times [2025-03-04 09:38:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:25,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323993493] [2025-03-04 09:38:25,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:25,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:38:25,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:38:25,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:25,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323993493] [2025-03-04 09:38:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323993493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:38:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170850131] [2025-03-04 09:38:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:38:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:38:25,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:38:25,697 INFO L87 Difference]: Start difference. First operand 1491 states and 2033 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-04 09:38:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:26,270 INFO L93 Difference]: Finished difference Result 1566 states and 2139 transitions. [2025-03-04 09:38:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:38:26,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-04 09:38:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:26,275 INFO L225 Difference]: With dead ends: 1566 [2025-03-04 09:38:26,275 INFO L226 Difference]: Without dead ends: 1566 [2025-03-04 09:38:26,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:26,276 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1346 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:26,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1276 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:38:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-04 09:38:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1468. [2025-03-04 09:38:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1142 states have (on average 1.7119089316987741) internal successors, (1955), 1459 states have internal predecessors, (1955), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1987 transitions. [2025-03-04 09:38:26,299 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1987 transitions. Word has length 17 [2025-03-04 09:38:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:26,300 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1987 transitions. [2025-03-04 09:38:26,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-04 09:38:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1987 transitions. [2025-03-04 09:38:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:38:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:26,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:38:26,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -888004906, now seen corresponding path program 1 times [2025-03-04 09:38:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349026542] [2025-03-04 09:38:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:26,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:38:26,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:38:26,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:26,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349026542] [2025-03-04 09:38:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349026542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:38:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109840347] [2025-03-04 09:38:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:26,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:26,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:26,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:26,353 INFO L87 Difference]: Start difference. First operand 1468 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-04 09:38:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:26,410 INFO L93 Difference]: Finished difference Result 1330 states and 1781 transitions. [2025-03-04 09:38:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-04 09:38:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:26,414 INFO L225 Difference]: With dead ends: 1330 [2025-03-04 09:38:26,415 INFO L226 Difference]: Without dead ends: 1330 [2025-03-04 09:38:26,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:26,415 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 60 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1903 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-04 09:38:26,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1903 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:38:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-04 09:38:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2025-03-04 09:38:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1016 states have (on average 1.7214566929133859) internal successors, (1749), 1321 states have internal predecessors, (1749), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1781 transitions. [2025-03-04 09:38:26,434 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1781 transitions. Word has length 17 [2025-03-04 09:38:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:26,434 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1781 transitions. [2025-03-04 09:38:26,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-04 09:38:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1781 transitions. [2025-03-04 09:38:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:38:26,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:26,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:38:26,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1758472147, now seen corresponding path program 1 times [2025-03-04 09:38:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369867306] [2025-03-04 09:38:26,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:26,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:38:26,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:38:26,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:26,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369867306] [2025-03-04 09:38:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369867306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:38:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064375437] [2025-03-04 09:38:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:38:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:38:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:38:26,490 INFO L87 Difference]: Start difference. First operand 1330 states and 1781 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:26,577 INFO L93 Difference]: Finished difference Result 1301 states and 1731 transitions. [2025-03-04 09:38:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:38:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:38:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:26,581 INFO L225 Difference]: With dead ends: 1301 [2025-03-04 09:38:26,581 INFO L226 Difference]: Without dead ends: 1301 [2025-03-04 09:38:26,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:26,581 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 41 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2801 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-04 09:38:26,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2801 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:38:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-03-04 09:38:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1295. [2025-03-04 09:38:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 988 states have (on average 1.7135627530364372) internal successors, (1693), 1286 states have internal predecessors, (1693), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1725 transitions. [2025-03-04 09:38:26,598 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1725 transitions. Word has length 18 [2025-03-04 09:38:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:26,598 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1725 transitions. [2025-03-04 09:38:26,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1725 transitions. [2025-03-04 09:38:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 09:38:26,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:26,599 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] [2025-03-04 09:38:26,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:38:26,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1274587005, now seen corresponding path program 1 times [2025-03-04 09:38:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945982076] [2025-03-04 09:38:26,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:26,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 09:38:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 09:38:26,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:26,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:26,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945982076] [2025-03-04 09:38:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945982076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:38:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526072084] [2025-03-04 09:38:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:26,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:38:26,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:26,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:38:26,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:38:26,737 INFO L87 Difference]: Start difference. First operand 1295 states and 1725 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:27,390 INFO L93 Difference]: Finished difference Result 2085 states and 2870 transitions. [2025-03-04 09:38:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:38:27,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2025-03-04 09:38:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:27,395 INFO L225 Difference]: With dead ends: 2085 [2025-03-04 09:38:27,395 INFO L226 Difference]: Without dead ends: 2085 [2025-03-04 09:38:27,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:27,396 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 824 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:27,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1822 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:38:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-04 09:38:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1291. [2025-03-04 09:38:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 988 states have (on average 1.7054655870445343) internal successors, (1685), 1282 states have internal predecessors, (1685), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1717 transitions. [2025-03-04 09:38:27,418 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1717 transitions. Word has length 32 [2025-03-04 09:38:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:27,418 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1717 transitions. [2025-03-04 09:38:27,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1717 transitions. [2025-03-04 09:38:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 09:38:27,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:27,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:27,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:38:27,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:27,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 816975703, now seen corresponding path program 1 times [2025-03-04 09:38:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042778879] [2025-03-04 09:38:27,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:27,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 09:38:27,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 09:38:27,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042778879] [2025-03-04 09:38:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042778879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:27,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:27,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:38:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936690941] [2025-03-04 09:38:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:27,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:38:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:27,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:38:27,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:38:27,506 INFO L87 Difference]: Start difference. First operand 1291 states and 1717 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:27,601 INFO L93 Difference]: Finished difference Result 1291 states and 1709 transitions. [2025-03-04 09:38:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:38:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 09:38:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:27,605 INFO L225 Difference]: With dead ends: 1291 [2025-03-04 09:38:27,605 INFO L226 Difference]: Without dead ends: 1291 [2025-03-04 09:38:27,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:27,607 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 21 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2783 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-04 09:38:27,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2783 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:38:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-04 09:38:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-03-04 09:38:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 988 states have (on average 1.6973684210526316) internal successors, (1677), 1282 states have internal predecessors, (1677), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:38:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1709 transitions. [2025-03-04 09:38:27,629 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1709 transitions. Word has length 66 [2025-03-04 09:38:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:27,629 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1709 transitions. [2025-03-04 09:38:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1709 transitions. [2025-03-04 09:38:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:38:27,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:27,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:27,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:38:27,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:27,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1585653407, now seen corresponding path program 1 times [2025-03-04 09:38:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339720227] [2025-03-04 09:38:27,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:27,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:38:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:38:27,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339720227] [2025-03-04 09:38:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339720227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:27,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:38:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238505495] [2025-03-04 09:38:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:38:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:27,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:38:27,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:27,774 INFO L87 Difference]: Start difference. First operand 1291 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:27,911 INFO L93 Difference]: Finished difference Result 1815 states and 2465 transitions. [2025-03-04 09:38:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:38:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-04 09:38:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:27,925 INFO L225 Difference]: With dead ends: 1815 [2025-03-04 09:38:27,925 INFO L226 Difference]: Without dead ends: 1815 [2025-03-04 09:38:27,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:38:27,925 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 362 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2120 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-04 09:38:27,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2120 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:38:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-04 09:38:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1758. [2025-03-04 09:38:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1445 states have (on average 1.6678200692041523) internal successors, (2410), 1749 states have internal predecessors, (2410), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2462 transitions. [2025-03-04 09:38:27,949 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2462 transitions. Word has length 74 [2025-03-04 09:38:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:27,949 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2462 transitions. [2025-03-04 09:38:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2462 transitions. [2025-03-04 09:38:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:38:27,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:27,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:38:27,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 376375084, now seen corresponding path program 1 times [2025-03-04 09:38:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59072173] [2025-03-04 09:38:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:38:27,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:38:27,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:27,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59072173] [2025-03-04 09:38:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59072173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:38:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101073759] [2025-03-04 09:38:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:38:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:28,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:38:28,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:28,420 INFO L87 Difference]: Start difference. First operand 1758 states and 2462 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:29,017 INFO L93 Difference]: Finished difference Result 1757 states and 2460 transitions. [2025-03-04 09:38:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:38:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:38:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:29,023 INFO L225 Difference]: With dead ends: 1757 [2025-03-04 09:38:29,025 INFO L226 Difference]: Without dead ends: 1757 [2025-03-04 09:38:29,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:38:29,026 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 2 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:29,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2739 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:38:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-03-04 09:38:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2025-03-04 09:38:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1445 states have (on average 1.6664359861591695) internal successors, (2408), 1748 states have internal predecessors, (2408), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2460 transitions. [2025-03-04 09:38:29,051 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2460 transitions. Word has length 82 [2025-03-04 09:38:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:29,051 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2460 transitions. [2025-03-04 09:38:29,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2460 transitions. [2025-03-04 09:38:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:38:29,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:29,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:29,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:38:29,054 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-04 09:38:29,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 376375083, now seen corresponding path program 1 times [2025-03-04 09:38:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74584748] [2025-03-04 09:38:29,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:29,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:38:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:38:29,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74584748] [2025-03-04 09:38:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74584748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:38:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557749524] [2025-03-04 09:38:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:38:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:38:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:38:29,305 INFO L87 Difference]: Start difference. First operand 1757 states and 2460 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:29,873 INFO L93 Difference]: Finished difference Result 1756 states and 2458 transitions. [2025-03-04 09:38:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:38:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:38:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:29,877 INFO L225 Difference]: With dead ends: 1756 [2025-03-04 09:38:29,877 INFO L226 Difference]: Without dead ends: 1756 [2025-03-04 09:38:29,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:38:29,878 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 1 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2801 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-04 09:38:29,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2801 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:38:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-03-04 09:38:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1756. [2025-03-04 09:38:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1443 states have (on average 1.6673596673596673) internal successors, (2406), 1747 states have internal predecessors, (2406), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2458 transitions. [2025-03-04 09:38:29,898 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2458 transitions. Word has length 82 [2025-03-04 09:38:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:29,898 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2458 transitions. [2025-03-04 09:38:29,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:38:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2458 transitions. [2025-03-04 09:38:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:38:29,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:29,899 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-04 09:38:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:38:29,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -268260568, now seen corresponding path program 1 times [2025-03-04 09:38:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081203644] [2025-03-04 09:38:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:29,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:38:29,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:38:29,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:29,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081203644] [2025-03-04 09:38:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081203644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:30,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:30,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:38:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732521959] [2025-03-04 09:38:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:30,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:38:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:30,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:38:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:38:30,108 INFO L87 Difference]: Start difference. First operand 1756 states and 2458 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:30,798 INFO L93 Difference]: Finished difference Result 1774 states and 2484 transitions. [2025-03-04 09:38:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:38:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 90 [2025-03-04 09:38:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:30,803 INFO L225 Difference]: With dead ends: 1774 [2025-03-04 09:38:30,803 INFO L226 Difference]: Without dead ends: 1774 [2025-03-04 09:38:30,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:38:30,803 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 13 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:30,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3735 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:38:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-04 09:38:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1765. [2025-03-04 09:38:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1451 states have (on average 1.6657477601654032) internal successors, (2417), 1754 states have internal predecessors, (2417), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-03-04 09:38:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2474 transitions. [2025-03-04 09:38:30,826 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2474 transitions. Word has length 90 [2025-03-04 09:38:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:30,827 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2474 transitions. [2025-03-04 09:38:30,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2474 transitions. [2025-03-04 09:38:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:38:30,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:30,828 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-04 09:38:30,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:38:30,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:30,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash -268260567, now seen corresponding path program 1 times [2025-03-04 09:38:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378938195] [2025-03-04 09:38:30,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:30,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:38:30,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:38:30,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:30,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378938195] [2025-03-04 09:38:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378938195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:38:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032188634] [2025-03-04 09:38:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:31,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:38:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:31,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:38:31,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:38:31,259 INFO L87 Difference]: Start difference. First operand 1765 states and 2474 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:32,120 INFO L93 Difference]: Finished difference Result 1765 states and 2472 transitions. [2025-03-04 09:38:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:38:32,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 90 [2025-03-04 09:38:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:32,130 INFO L225 Difference]: With dead ends: 1765 [2025-03-04 09:38:32,130 INFO L226 Difference]: Without dead ends: 1765 [2025-03-04 09:38:32,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:38:32,131 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 8 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:32,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3502 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:38:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-03-04 09:38:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2025-03-04 09:38:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1451 states have (on average 1.664369400413508) internal successors, (2415), 1754 states have internal predecessors, (2415), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-03-04 09:38:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2472 transitions. [2025-03-04 09:38:32,156 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2472 transitions. Word has length 90 [2025-03-04 09:38:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:32,156 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2472 transitions. [2025-03-04 09:38:32,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2472 transitions. [2025-03-04 09:38:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:38:32,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:32,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:38:32,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:32,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1949024391, now seen corresponding path program 1 times [2025-03-04 09:38:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688524855] [2025-03-04 09:38:32,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:32,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:38:32,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:38:32,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:32,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688524855] [2025-03-04 09:38:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688524855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529092821] [2025-03-04 09:38:32,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:32,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:32,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:38:32,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:38:32,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:38:32,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:32,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:38:32,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:32,845 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:38:32,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:38:32,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:38:32,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:33,107 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:33,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:38:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:33,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529092821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:33,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 09:38:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623790015] [2025-03-04 09:38:33,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:33,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:38:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:33,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:38:33,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=318, Unknown=6, NotChecked=0, Total=380 [2025-03-04 09:38:33,232 INFO L87 Difference]: Start difference. First operand 1765 states and 2472 transitions. Second operand has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:35,279 INFO L93 Difference]: Finished difference Result 1772 states and 2478 transitions. [2025-03-04 09:38:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:38:35,282 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 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 91 [2025-03-04 09:38:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:35,288 INFO L225 Difference]: With dead ends: 1772 [2025-03-04 09:38:35,288 INFO L226 Difference]: Without dead ends: 1772 [2025-03-04 09:38:35,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2025-03-04 09:38:35,289 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 903 mSDsluCounter, 6360 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 6960 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:35,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 6960 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:38:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-04 09:38:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1769. [2025-03-04 09:38:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1455 states have (on average 1.6618556701030929) internal successors, (2418), 1757 states have internal predecessors, (2418), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2472 transitions. [2025-03-04 09:38:35,321 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2472 transitions. Word has length 91 [2025-03-04 09:38:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:35,323 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2472 transitions. [2025-03-04 09:38:35,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2472 transitions. [2025-03-04 09:38:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:38:35,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:35,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:35,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:38:35,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 09:38:35,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:35,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1949024390, now seen corresponding path program 1 times [2025-03-04 09:38:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:35,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691436927] [2025-03-04 09:38:35,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:35,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:38:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:38:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691436927] [2025-03-04 09:38:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691436927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565574671] [2025-03-04 09:38:36,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:36,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:36,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:36,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:36,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:38:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:38:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:38:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:36,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 09:38:36,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:36,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:38:36,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:38:36,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:38:36,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:38:36,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:38:36,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:36,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:36,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:36,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:36,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:38:36,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:36,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565574671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:36,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-04 09:38:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270110691] [2025-03-04 09:38:36,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:36,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:38:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:38:36,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=347, Unknown=12, NotChecked=0, Total=420 [2025-03-04 09:38:36,694 INFO L87 Difference]: Start difference. First operand 1769 states and 2472 transitions. Second operand has 18 states, 15 states have (on average 7.733333333333333) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:39,418 INFO L93 Difference]: Finished difference Result 1771 states and 2476 transitions. [2025-03-04 09:38:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:38:39,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.733333333333333) internal successors, (116), 18 states have internal predecessors, (116), 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 91 [2025-03-04 09:38:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:39,421 INFO L225 Difference]: With dead ends: 1771 [2025-03-04 09:38:39,421 INFO L226 Difference]: Without dead ends: 1771 [2025-03-04 09:38:39,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=493, Unknown=12, NotChecked=0, Total=600 [2025-03-04 09:38:39,422 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 886 mSDsluCounter, 6233 mSDsCounter, 0 mSdLazyCounter, 6879 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 6903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:39,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 6836 Invalid, 6903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6879 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 09:38:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-04 09:38:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1759. [2025-03-04 09:38:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.663441603317208) internal successors, (2407), 1749 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2459 transitions. [2025-03-04 09:38:39,440 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2459 transitions. Word has length 91 [2025-03-04 09:38:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:39,440 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2459 transitions. [2025-03-04 09:38:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.733333333333333) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2459 transitions. [2025-03-04 09:38:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:38:39,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:39,441 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-04 09:38:39,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:38:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:38:39,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1184454141, now seen corresponding path program 1 times [2025-03-04 09:38:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011459866] [2025-03-04 09:38:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:39,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:38:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:38:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:40,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-04 09:38:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011459866] [2025-03-04 09:38:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011459866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:38:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602935139] [2025-03-04 09:38:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:40,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:38:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:40,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:38:40,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:38:40,010 INFO L87 Difference]: Start difference. First operand 1759 states and 2459 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:41,269 INFO L93 Difference]: Finished difference Result 1778 states and 2484 transitions. [2025-03-04 09:38:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:38:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:38:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:41,272 INFO L225 Difference]: With dead ends: 1778 [2025-03-04 09:38:41,272 INFO L226 Difference]: Without dead ends: 1778 [2025-03-04 09:38:41,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:38:41,273 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 907 mSDsluCounter, 4646 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:41,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 5246 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:38:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-03-04 09:38:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1774. [2025-03-04 09:38:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1762 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2478 transitions. [2025-03-04 09:38:41,290 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2478 transitions. Word has length 93 [2025-03-04 09:38:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:41,290 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2478 transitions. [2025-03-04 09:38:41,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2478 transitions. [2025-03-04 09:38:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:38:41,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:41,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:41,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:38:41,291 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:41,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1184454142, now seen corresponding path program 1 times [2025-03-04 09:38:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:41,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051199622] [2025-03-04 09:38:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:41,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:38:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:38:41,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051199622] [2025-03-04 09:38:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051199622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:41,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:41,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:38:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824088439] [2025-03-04 09:38:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:41,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:38:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:41,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:38:41,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:38:41,711 INFO L87 Difference]: Start difference. First operand 1774 states and 2478 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:43,047 INFO L93 Difference]: Finished difference Result 1777 states and 2482 transitions. [2025-03-04 09:38:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:38:43,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:38:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:43,049 INFO L225 Difference]: With dead ends: 1777 [2025-03-04 09:38:43,049 INFO L226 Difference]: Without dead ends: 1777 [2025-03-04 09:38:43,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:38:43,050 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 889 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:43,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3564 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:38:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-04 09:38:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1774. [2025-03-04 09:38:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6577686516084873) internal successors, (2422), 1762 states have internal predecessors, (2422), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2476 transitions. [2025-03-04 09:38:43,065 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2476 transitions. Word has length 93 [2025-03-04 09:38:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:43,065 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2476 transitions. [2025-03-04 09:38:43,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2476 transitions. [2025-03-04 09:38:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:38:43,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:43,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:38:43,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 278139916, now seen corresponding path program 1 times [2025-03-04 09:38:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719840095] [2025-03-04 09:38:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:43,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:38:43,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:38:43,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:43,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:43,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719840095] [2025-03-04 09:38:43,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719840095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:43,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334421392] [2025-03-04 09:38:43,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:43,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:43,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:38:43,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:38:43,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:38:43,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:43,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:43,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:38:43,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:43,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:38:43,747 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:38:43,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:38:43,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:38:43,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:43,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:43,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:43,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:44,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-04 09:38:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:44,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:44,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2025-03-04 09:38:44,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1012 (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$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1012))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:38:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334421392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:44,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:38:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407428340] [2025-03-04 09:38:44,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:38:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:44,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:38:44,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=425, Unknown=11, NotChecked=86, Total=600 [2025-03-04 09:38:44,090 INFO L87 Difference]: Start difference. First operand 1774 states and 2476 transitions. Second operand has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:46,223 INFO L93 Difference]: Finished difference Result 1776 states and 2480 transitions. [2025-03-04 09:38:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:38:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-04 09:38:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:46,225 INFO L225 Difference]: With dead ends: 1776 [2025-03-04 09:38:46,225 INFO L226 Difference]: Without dead ends: 1776 [2025-03-04 09:38:46,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=547, Unknown=12, NotChecked=98, Total=756 [2025-03-04 09:38:46,226 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 872 mSDsluCounter, 7486 mSDsCounter, 0 mSdLazyCounter, 5627 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 8085 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:46,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 8085 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5627 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:38:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-03-04 09:38:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1773. [2025-03-04 09:38:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1461 states have (on average 1.6563997262149213) internal successors, (2420), 1761 states have internal predecessors, (2420), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2474 transitions. [2025-03-04 09:38:46,239 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2474 transitions. Word has length 94 [2025-03-04 09:38:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:46,239 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2474 transitions. [2025-03-04 09:38:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2474 transitions. [2025-03-04 09:38:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:38:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:46,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:46,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:38:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:46,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 278139917, now seen corresponding path program 1 times [2025-03-04 09:38:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659371029] [2025-03-04 09:38:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:46,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:38:46,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:38:46,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:46,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659371029] [2025-03-04 09:38:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659371029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326735160] [2025-03-04 09:38:46,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:46,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:46,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:46,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:46,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:38:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:38:47,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:38:47,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:47,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:38:47,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:47,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:38:47,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:38:47,185 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:38:47,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:38:47,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-04 09:38:47,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:38:47,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:47,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:47,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:47,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:47,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:47,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:47,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:47,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:38:47,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:47,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:47,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-04 09:38:47,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1169))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170) .cse0 v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1170) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-04 09:38:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326735160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:47,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:47,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-04 09:38:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795962980] [2025-03-04 09:38:47,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:47,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:38:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:47,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:38:47,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=310, Unknown=9, NotChecked=74, Total=462 [2025-03-04 09:38:47,518 INFO L87 Difference]: Start difference. First operand 1773 states and 2474 transitions. Second operand has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 17 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:48,885 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2025-03-04 09:38:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:38:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 17 states have internal predecessors, (142), 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 94 [2025-03-04 09:38:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:48,888 INFO L225 Difference]: With dead ends: 1775 [2025-03-04 09:38:48,889 INFO L226 Difference]: Without dead ends: 1775 [2025-03-04 09:38:48,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=489, Unknown=9, NotChecked=94, Total=702 [2025-03-04 09:38:48,889 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 876 mSDsluCounter, 3650 mSDsCounter, 0 mSdLazyCounter, 3563 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 3583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:48,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 4252 Invalid, 3583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3563 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:38:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-03-04 09:38:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1757. [2025-03-04 09:38:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1447 states have (on average 1.6606772633033864) internal successors, (2403), 1747 states have internal predecessors, (2403), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2455 transitions. [2025-03-04 09:38:48,909 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2455 transitions. Word has length 94 [2025-03-04 09:38:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:48,909 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2455 transitions. [2025-03-04 09:38:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 17 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2455 transitions. [2025-03-04 09:38:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:38:48,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:48,910 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-04 09:38:48,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:38:49,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:49,110 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1377098783, now seen corresponding path program 1 times [2025-03-04 09:38:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224725943] [2025-03-04 09:38:49,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:49,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:38:49,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:38:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224725943] [2025-03-04 09:38:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224725943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:38:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883429825] [2025-03-04 09:38:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:38:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:49,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:38:49,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:38:49,433 INFO L87 Difference]: Start difference. First operand 1757 states and 2455 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:50,687 INFO L93 Difference]: Finished difference Result 1782 states and 2486 transitions. [2025-03-04 09:38:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:38:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-04 09:38:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:50,692 INFO L225 Difference]: With dead ends: 1782 [2025-03-04 09:38:50,693 INFO L226 Difference]: Without dead ends: 1782 [2025-03-04 09:38:50,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:38:50,694 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 911 mSDsluCounter, 4656 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 5258 SdHoareTripleChecker+Invalid, 3588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:50,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 5258 Invalid, 3588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:38:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-04 09:38:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1778. [2025-03-04 09:38:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1467 states have (on average 1.6537150647580094) internal successors, (2426), 1766 states have internal predecessors, (2426), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2480 transitions. [2025-03-04 09:38:50,708 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2480 transitions. Word has length 96 [2025-03-04 09:38:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:50,709 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2480 transitions. [2025-03-04 09:38:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2480 transitions. [2025-03-04 09:38:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:38:50,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:50,710 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-04 09:38:50,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:38:50,710 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1377098782, now seen corresponding path program 1 times [2025-03-04 09:38:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37614152] [2025-03-04 09:38:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:50,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:38:50,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:38:50,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:50,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37614152] [2025-03-04 09:38:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37614152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:38:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004262739] [2025-03-04 09:38:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:38:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:51,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:38:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:38:51,132 INFO L87 Difference]: Start difference. First operand 1778 states and 2480 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:52,537 INFO L93 Difference]: Finished difference Result 1781 states and 2484 transitions. [2025-03-04 09:38:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:38:52,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-04 09:38:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:52,541 INFO L225 Difference]: With dead ends: 1781 [2025-03-04 09:38:52,541 INFO L226 Difference]: Without dead ends: 1781 [2025-03-04 09:38:52,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:38:52,542 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 889 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 3737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:52,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 4119 Invalid, 3737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3720 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:38:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-04 09:38:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1778. [2025-03-04 09:38:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1467 states have (on average 1.6523517382413089) internal successors, (2424), 1766 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2478 transitions. [2025-03-04 09:38:52,574 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2478 transitions. Word has length 96 [2025-03-04 09:38:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:52,574 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2478 transitions. [2025-03-04 09:38:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:38:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2478 transitions. [2025-03-04 09:38:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:38:52,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:52,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:38:52,575 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1075214194, now seen corresponding path program 1 times [2025-03-04 09:38:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:52,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361146987] [2025-03-04 09:38:52,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:52,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:38:52,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:38:52,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361146987] [2025-03-04 09:38:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361146987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696079818] [2025-03-04 09:38:52,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:52,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:52,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:52,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:38:53,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:38:53,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:38:53,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:53,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:53,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:38:53,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:38:53,180 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:38:53,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:38:53,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:38:53,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:53,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:53,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:53,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:53,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:53,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:53,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:38:53,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:38:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:53,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:53,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:38:53,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (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$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1475))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1476)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:38:53,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1475))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1476)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:38:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696079818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:53,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:53,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 09:38:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012058260] [2025-03-04 09:38:53,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:53,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:38:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:53,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:38:53,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=531, Unknown=35, NotChecked=150, Total=812 [2025-03-04 09:38:53,546 INFO L87 Difference]: Start difference. First operand 1778 states and 2478 transitions. Second operand has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:55,260 INFO L93 Difference]: Finished difference Result 1780 states and 2482 transitions. [2025-03-04 09:38:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:38:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-03-04 09:38:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:55,263 INFO L225 Difference]: With dead ends: 1780 [2025-03-04 09:38:55,263 INFO L226 Difference]: Without dead ends: 1780 [2025-03-04 09:38:55,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=672, Unknown=35, NotChecked=168, Total=992 [2025-03-04 09:38:55,265 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 867 mSDsluCounter, 6326 mSDsCounter, 0 mSdLazyCounter, 4761 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 6924 SdHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:55,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 6924 Invalid, 4781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4761 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:38:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-04 09:38:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1777. [2025-03-04 09:38:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1467 states have (on average 1.650988411724608) internal successors, (2422), 1765 states have internal predecessors, (2422), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:38:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2476 transitions. [2025-03-04 09:38:55,280 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2476 transitions. Word has length 97 [2025-03-04 09:38:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:55,281 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2476 transitions. [2025-03-04 09:38:55,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2476 transitions. [2025-03-04 09:38:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:38:55,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:55,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:38:55,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:38:55,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 09:38:55,482 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:55,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1075214195, now seen corresponding path program 1 times [2025-03-04 09:38:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:55,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285880428] [2025-03-04 09:38:55,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:55,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:55,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:38:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:38:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285880428] [2025-03-04 09:38:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285880428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824916576] [2025-03-04 09:38:56,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:38:56,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:38:56,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:38:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:38:56,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:38:56,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:56,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:56,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:38:56,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:38:56,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:38:56,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:38:56,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:38:56,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:38:56,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:38:56,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:38:56,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:38:56,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:56,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:56,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:56,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:56,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:56,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:56,643 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:38:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:38:56,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:38:56,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:38:56,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:38:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:56,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:38:56,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1643))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1642) .cse0 v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1642) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-04 09:38:56,798 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1643))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1642) .cse1 v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1642) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-04 09:38:56,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1651))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1643))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1650) .cse0 v_ArrVal_1642) .cse1 v_ArrVal_1645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1650 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1651))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1650) .cse5 v_ArrVal_1642) (select (select (store .cse6 .cse5 v_ArrVal_1643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1645))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-04 09:38:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824916576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:38:56,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:38:56,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2025-03-04 09:38:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624243044] [2025-03-04 09:38:56,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:38:56,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:38:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:56,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:38:56,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=410, Unknown=20, NotChecked=132, Total=650 [2025-03-04 09:38:56,851 INFO L87 Difference]: Start difference. First operand 1777 states and 2476 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 19 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:38:59,229 INFO L93 Difference]: Finished difference Result 1779 states and 2480 transitions. [2025-03-04 09:38:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:38:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 19 states have internal predecessors, (147), 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 97 [2025-03-04 09:38:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:38:59,231 INFO L225 Difference]: With dead ends: 1779 [2025-03-04 09:38:59,231 INFO L226 Difference]: Without dead ends: 1779 [2025-03-04 09:38:59,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=663, Unknown=21, NotChecked=168, Total=992 [2025-03-04 09:38:59,232 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 871 mSDsluCounter, 5424 mSDsCounter, 0 mSdLazyCounter, 5620 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 5641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:38:59,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 6025 Invalid, 5641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5620 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 09:38:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-03-04 09:38:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1755. [2025-03-04 09:38:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1447 states have (on average 1.6579129232895646) internal successors, (2399), 1745 states have internal predecessors, (2399), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:38:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2451 transitions. [2025-03-04 09:38:59,245 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2451 transitions. Word has length 97 [2025-03-04 09:38:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:38:59,246 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2451 transitions. [2025-03-04 09:38:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 19 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:38:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2451 transitions. [2025-03-04 09:38:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:38:59,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:38:59,247 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-04 09:38:59,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:38:59,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:38:59,448 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:38:59,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:38:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 378650710, now seen corresponding path program 1 times [2025-03-04 09:38:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:38:59,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52769542] [2025-03-04 09:38:59,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:38:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:38:59,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:38:59,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:38:59,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:38:59,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:38:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:38:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:38:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52769542] [2025-03-04 09:38:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52769542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:38:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:38:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:38:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114397581] [2025-03-04 09:38:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:38:59,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:38:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:38:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:38:59,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:38:59,756 INFO L87 Difference]: Start difference. First operand 1755 states and 2451 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:01,127 INFO L93 Difference]: Finished difference Result 1786 states and 2488 transitions. [2025-03-04 09:39:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:39:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2025-03-04 09:39:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:01,130 INFO L225 Difference]: With dead ends: 1786 [2025-03-04 09:39:01,130 INFO L226 Difference]: Without dead ends: 1786 [2025-03-04 09:39:01,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:39:01,131 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 897 mSDsluCounter, 5784 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 6385 SdHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:01,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 6385 Invalid, 4373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:39:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-03-04 09:39:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1782. [2025-03-04 09:39:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1473 states have (on average 1.648336727766463) internal successors, (2428), 1770 states have internal predecessors, (2428), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2482 transitions. [2025-03-04 09:39:01,143 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2482 transitions. Word has length 99 [2025-03-04 09:39:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:01,143 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2482 transitions. [2025-03-04 09:39:01,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2482 transitions. [2025-03-04 09:39:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:39:01,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:01,144 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-04 09:39:01,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 09:39:01,144 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:01,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 378650711, now seen corresponding path program 1 times [2025-03-04 09:39:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704647381] [2025-03-04 09:39:01,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:39:01,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:39:01,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:01,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704647381] [2025-03-04 09:39:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704647381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:39:01,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:39:01,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:39:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539240111] [2025-03-04 09:39:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:39:01,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:39:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:01,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:39:01,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:39:01,702 INFO L87 Difference]: Start difference. First operand 1782 states and 2482 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:03,477 INFO L93 Difference]: Finished difference Result 1785 states and 2486 transitions. [2025-03-04 09:39:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:39:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2025-03-04 09:39:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:03,480 INFO L225 Difference]: With dead ends: 1785 [2025-03-04 09:39:03,480 INFO L226 Difference]: Without dead ends: 1785 [2025-03-04 09:39:03,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:39:03,481 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 889 mSDsluCounter, 4412 mSDsCounter, 0 mSdLazyCounter, 4757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 5014 SdHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:03,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 5014 Invalid, 4774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4757 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 09:39:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-03-04 09:39:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1782. [2025-03-04 09:39:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1473 states have (on average 1.646978954514596) internal successors, (2426), 1770 states have internal predecessors, (2426), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2480 transitions. [2025-03-04 09:39:03,502 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2480 transitions. Word has length 99 [2025-03-04 09:39:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:03,502 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2480 transitions. [2025-03-04 09:39:03,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2480 transitions. [2025-03-04 09:39:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:39:03,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:03,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:39:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 09:39:03,504 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -159156443, now seen corresponding path program 1 times [2025-03-04 09:39:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275422046] [2025-03-04 09:39:03,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:03,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:39:03,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:39:03,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:03,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275422046] [2025-03-04 09:39:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275422046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909072606] [2025-03-04 09:39:03,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:39:03,977 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:39:03,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:39:04,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:39:04,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:39:04,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:04,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:04,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:39:04,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:39:04,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:39:04,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:39:04,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:39:04,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:39:04,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:39:04,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:04,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:04,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:04,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:04,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:04,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:04,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:04,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:04,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:39:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:04,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:39:04,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (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$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1981))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:39:04,649 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (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$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1980))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1981)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:39:04,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1980))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1981)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:39:04,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (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$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1985))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1980)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1981)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:39:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909072606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:04,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:39:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-04 09:39:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223811112] [2025-03-04 09:39:04,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:39:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:39:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:04,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:39:04,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=678, Unknown=22, NotChecked=228, Total=1056 [2025-03-04 09:39:04,676 INFO L87 Difference]: Start difference. First operand 1782 states and 2480 transitions. Second operand has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:06,918 INFO L93 Difference]: Finished difference Result 1784 states and 2484 transitions. [2025-03-04 09:39:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:39:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 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 100 [2025-03-04 09:39:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:06,921 INFO L225 Difference]: With dead ends: 1784 [2025-03-04 09:39:06,921 INFO L226 Difference]: Without dead ends: 1784 [2025-03-04 09:39:06,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=834, Unknown=23, NotChecked=252, Total=1260 [2025-03-04 09:39:06,922 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 858 mSDsluCounter, 8612 mSDsCounter, 0 mSdLazyCounter, 6249 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 9209 SdHoareTripleChecker+Invalid, 6267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:06,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 9209 Invalid, 6267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6249 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 09:39:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-04 09:39:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1781. [2025-03-04 09:39:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1473 states have (on average 1.645621181262729) internal successors, (2424), 1769 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2478 transitions. [2025-03-04 09:39:06,935 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2478 transitions. Word has length 100 [2025-03-04 09:39:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2478 transitions. [2025-03-04 09:39:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2478 transitions. [2025-03-04 09:39:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:39:06,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:06,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:39:06,944 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-04 09:39:07,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:07,137 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash -159156442, now seen corresponding path program 1 times [2025-03-04 09:39:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186625743] [2025-03-04 09:39:07,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:07,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:39:07,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:39:07,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:07,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:07,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186625743] [2025-03-04 09:39:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186625743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209272460] [2025-03-04 09:39:07,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:39:07,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:39:07,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:39:07,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:39:07,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:39:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:07,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 09:39:07,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:39:07,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:39:08,031 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:39:08,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:39:08,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:39:08,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:39:08,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:39:08,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:39:08,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:39:08,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:08,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:39:08,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:08,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:39:08,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:08,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:08,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:39:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:08,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:08,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:39:08,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:08,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:39:08,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:39:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:08,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:39:08,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2164 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:39:08,343 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2164 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:39:08,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2162))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2163) .cse1 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:39:08,365 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2163) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-03-04 09:39:08,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2161))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2160) .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2161))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2160) .cse5 v_ArrVal_2163) (select (select (store .cse6 .cse5 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2164))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-04 09:39:08,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2170))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2161))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2162))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2171) .cse0 v_ArrVal_2160) .cse1 v_ArrVal_2163) .cse2 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2170))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2161))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2171) .cse7 v_ArrVal_2160) .cse8 v_ArrVal_2163) (select (select (store .cse9 .cse8 v_ArrVal_2162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2164))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-04 09:39:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209272460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:08,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:39:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2025-03-04 09:39:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926858129] [2025-03-04 09:39:08,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:39:08,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 09:39:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:08,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 09:39:08,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=461, Unknown=12, NotChecked=294, Total=870 [2025-03-04 09:39:08,958 INFO L87 Difference]: Start difference. First operand 1781 states and 2478 transitions. Second operand has 21 states, 18 states have (on average 8.444444444444445) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:11,048 INFO L93 Difference]: Finished difference Result 1783 states and 2482 transitions. [2025-03-04 09:39:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:39:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.444444444444445) internal successors, (152), 21 states have internal predecessors, (152), 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 100 [2025-03-04 09:39:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:11,050 INFO L225 Difference]: With dead ends: 1783 [2025-03-04 09:39:11,050 INFO L226 Difference]: Without dead ends: 1783 [2025-03-04 09:39:11,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=778, Unknown=12, NotChecked=378, Total=1332 [2025-03-04 09:39:11,051 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 878 mSDsluCounter, 4299 mSDsCounter, 0 mSdLazyCounter, 4868 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 4899 SdHoareTripleChecker+Invalid, 4898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:11,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 4899 Invalid, 4898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4868 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:39:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-04 09:39:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1753. [2025-03-04 09:39:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1447 states have (on average 1.6551485832757429) internal successors, (2395), 1743 states have internal predecessors, (2395), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:39:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2447 transitions. [2025-03-04 09:39:11,070 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2447 transitions. Word has length 100 [2025-03-04 09:39:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:11,071 INFO L471 AbstractCegarLoop]: Abstraction has 1753 states and 2447 transitions. [2025-03-04 09:39:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.444444444444445) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2447 transitions. [2025-03-04 09:39:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 09:39:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:11,071 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-04 09:39:11,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:39:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 09:39:11,273 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:11,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -32743856, now seen corresponding path program 1 times [2025-03-04 09:39:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713384901] [2025-03-04 09:39:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 09:39:11,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 09:39:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713384901] [2025-03-04 09:39:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713384901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:39:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:39:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:39:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513511954] [2025-03-04 09:39:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:39:11,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:39:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:11,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:39:11,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:39:11,795 INFO L87 Difference]: Start difference. First operand 1753 states and 2447 transitions. Second operand has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:13,675 INFO L93 Difference]: Finished difference Result 1792 states and 2492 transitions. [2025-03-04 09:39:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:39:13,675 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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 103 [2025-03-04 09:39:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:13,677 INFO L225 Difference]: With dead ends: 1792 [2025-03-04 09:39:13,677 INFO L226 Difference]: Without dead ends: 1792 [2025-03-04 09:39:13,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:39:13,677 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 892 mSDsluCounter, 6888 mSDsCounter, 0 mSdLazyCounter, 5217 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 7485 SdHoareTripleChecker+Invalid, 5237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:13,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 7485 Invalid, 5237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5217 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:39:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-04 09:39:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1788. [2025-03-04 09:39:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1481 states have (on average 1.6421336934503714) internal successors, (2432), 1776 states have internal predecessors, (2432), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2486 transitions. [2025-03-04 09:39:13,689 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2486 transitions. Word has length 103 [2025-03-04 09:39:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:13,689 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2486 transitions. [2025-03-04 09:39:13,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2486 transitions. [2025-03-04 09:39:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 09:39:13,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:13,689 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-04 09:39:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 09:39:13,690 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash -32743855, now seen corresponding path program 1 times [2025-03-04 09:39:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:13,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284161618] [2025-03-04 09:39:13,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:13,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 09:39:13,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 09:39:13,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:13,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:14,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284161618] [2025-03-04 09:39:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284161618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:39:14,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:39:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:39:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864650701] [2025-03-04 09:39:14,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:39:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:39:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:14,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:39:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:39:14,346 INFO L87 Difference]: Start difference. First operand 1788 states and 2486 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:16,011 INFO L93 Difference]: Finished difference Result 1791 states and 2490 transitions. [2025-03-04 09:39:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:39:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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 103 [2025-03-04 09:39:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:16,013 INFO L225 Difference]: With dead ends: 1791 [2025-03-04 09:39:16,014 INFO L226 Difference]: Without dead ends: 1791 [2025-03-04 09:39:16,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:39:16,014 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 912 mSDsluCounter, 3949 mSDsCounter, 0 mSdLazyCounter, 4264 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:16,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 4547 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4264 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:39:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-04 09:39:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1788. [2025-03-04 09:39:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1481 states have (on average 1.6407832545577312) internal successors, (2430), 1776 states have internal predecessors, (2430), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2484 transitions. [2025-03-04 09:39:16,026 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2484 transitions. Word has length 103 [2025-03-04 09:39:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:16,027 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2484 transitions. [2025-03-04 09:39:16,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:39:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2484 transitions. [2025-03-04 09:39:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:39:16,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:16,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:39:16,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 09:39:16,028 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:16,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1919412833, now seen corresponding path program 1 times [2025-03-04 09:39:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164893173] [2025-03-04 09:39:16,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:16,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:39:16,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:39:16,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:16,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164893173] [2025-03-04 09:39:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164893173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820592542] [2025-03-04 09:39:16,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:16,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:16,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:39:16,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:39:16,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:39:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:39:16,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:39:16,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:16,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:16,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 09:39:16,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:39:16,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:39:16,826 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:39:16,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:39:16,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:39:16,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:39:16,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:16,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:17,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:17,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:17,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:17,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:17,118 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:17,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:17,160 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:17,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:39:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:39:17,216 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 09:39:17,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-04 09:39:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:17,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:39:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820592542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:17,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:39:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2025-03-04 09:39:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233873440] [2025-03-04 09:39:17,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:39:17,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 09:39:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:17,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 09:39:17,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1159, Unknown=57, NotChecked=0, Total=1406 [2025-03-04 09:39:17,755 INFO L87 Difference]: Start difference. First operand 1788 states and 2484 transitions. Second operand has 27 states, 24 states have (on average 7.041666666666667) internal successors, (169), 26 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:39:20,080 INFO L93 Difference]: Finished difference Result 1790 states and 2488 transitions. [2025-03-04 09:39:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:39:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.041666666666667) internal successors, (169), 26 states have internal predecessors, (169), 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 104 [2025-03-04 09:39:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:39:20,082 INFO L225 Difference]: With dead ends: 1790 [2025-03-04 09:39:20,082 INFO L226 Difference]: Without dead ends: 1790 [2025-03-04 09:39:20,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1367, Unknown=57, NotChecked=0, Total=1640 [2025-03-04 09:39:20,083 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 855 mSDsluCounter, 7993 mSDsCounter, 0 mSdLazyCounter, 6062 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 8589 SdHoareTripleChecker+Invalid, 6080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:39:20,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 8589 Invalid, 6080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6062 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 09:39:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2025-03-04 09:39:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1787. [2025-03-04 09:39:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1481 states have (on average 1.6394328156650912) internal successors, (2428), 1775 states have internal predecessors, (2428), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:39:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2482 transitions. [2025-03-04 09:39:20,098 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2482 transitions. Word has length 104 [2025-03-04 09:39:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:39:20,098 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2482 transitions. [2025-03-04 09:39:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.041666666666667) internal successors, (169), 26 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:39:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2482 transitions. [2025-03-04 09:39:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:39:20,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:39:20,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:39:20,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:39:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:20,300 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:39:20,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:39:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1919412832, now seen corresponding path program 1 times [2025-03-04 09:39:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:39:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922476561] [2025-03-04 09:39:20,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:39:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:39:20,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:39:20,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:21,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:39:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922476561] [2025-03-04 09:39:21,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922476561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806691480] [2025-03-04 09:39:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:39:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:39:21,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:39:21,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:39:21,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:39:21,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:39:21,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:39:21,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:39:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:39:21,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 09:39:21,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:39:21,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:39:21,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:39:21,384 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:39:21,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:39:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:39:21,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:39:21,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 09:39:21,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:39:21,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:39:21,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:21,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:21,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:39:21,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-04 09:39:21,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:21,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:39:21,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:21,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:21,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:39:21,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:21,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:39:21,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-04 09:39:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:39:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-03-04 09:39:21,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:39:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:39:21,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 09:39:21,953 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:39:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:39:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:39:21,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:39:22,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (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_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2735) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2739 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2736))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2735) .cse1 v_ArrVal_2738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2739) (select (select (store .cse2 .cse1 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2025-03-04 09:39:22,566 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (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_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2733))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2734) .cse1 v_ArrVal_2735) (select (select (store .cse2 .cse1 v_ArrVal_2736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2738))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2739 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2733))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2736))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2734) .cse4 v_ArrVal_2735) .cse5 v_ArrVal_2738) |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_2739) (select (select (store .cse6 .cse5 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-03-04 09:39:38,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (v_ArrVal_2731 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2744))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2732))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2733))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2745) .cse0 v_ArrVal_2731) .cse1 v_ArrVal_2734) .cse2 v_ArrVal_2735) (select (select (store .cse3 .cse2 v_ArrVal_2736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2738))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 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_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2732 (Array Int Int)) (v_ArrVal_2731 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2739 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2744))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2732))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2733))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2736))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2745) .cse7 v_ArrVal_2731) .cse8 v_ArrVal_2734) .cse9 v_ArrVal_2735) .cse10 v_ArrVal_2738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2739) (select (select (store .cse11 .cse10 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2025-03-04 09:39:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806691480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:39:38,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:39:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-04 09:39:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286558305] [2025-03-04 09:39:38,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:39:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 09:39:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:39:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 09:39:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1288, Unknown=36, NotChecked=228, Total=1722 [2025-03-04 09:39:38,014 INFO L87 Difference]: Start difference. First operand 1787 states and 2482 transitions. Second operand has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 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)