./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:42:37,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:42:37,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:42:37,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:42:37,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:42:38,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:42:38,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:42:38,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:42:38,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:42:38,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:42:38,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:42:38,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:42:38,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:42:38,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:42:38,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:42:38,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:42:38,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:42:38,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:42:38,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:42:38,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:42:38,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:42:38,013 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-03-09 00:42:38,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:42:38,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:42:38,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:42:38,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:42:38,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:42:38,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i [2025-03-09 00:42:39,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba045e451/c78ae0edba28466da095dfe4be64729b/FLAG417943b17 [2025-03-09 00:42:39,773 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:42:39,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-1.i [2025-03-09 00:42:39,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba045e451/c78ae0edba28466da095dfe4be64729b/FLAG417943b17 [2025-03-09 00:42:39,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba045e451/c78ae0edba28466da095dfe4be64729b [2025-03-09 00:42:39,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:42:39,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:42:39,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:39,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:42:39,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:42:39,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:39" (1/1) ... [2025-03-09 00:42:39,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:39, skipping insertion in model container [2025-03-09 00:42:39,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:39" (1/1) ... [2025-03-09 00:42:40,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:42:40,326 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,351 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,354 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,357 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,362 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,390 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,392 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,409 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:40,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:40,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:42:40,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:40,534 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:42:40,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40 WrapperNode [2025-03-09 00:42:40,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:40,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:42:40,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:42:40,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:42:40,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,610 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1517 [2025-03-09 00:42:40,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:42:40,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:42:40,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:42:40,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:42:40,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,692 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-03-09 00:42:40,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:42:40,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:42:40,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:42:40,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:42:40,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (1/1) ... [2025-03-09 00:42:40,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:42:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:40,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:42:40,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:42:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:42:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:42:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:42:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:42:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:42:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:42:40,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:42:40,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:42:40,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:42:42,835 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2025-03-09 00:42:42,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:42:42,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:42:42,920 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 00:42:42,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:42:42 BoogieIcfgContainer [2025-03-09 00:42:42,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:42:42,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:42:42,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:42:42,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:42:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:42:39" (1/3) ... [2025-03-09 00:42:42,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e135f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:42:42, skipping insertion in model container [2025-03-09 00:42:42,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:40" (2/3) ... [2025-03-09 00:42:42,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e135f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:42:42, skipping insertion in model container [2025-03-09 00:42:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:42:42" (3/3) ... [2025-03-09 00:42:42,930 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-1.i [2025-03-09 00:42:42,943 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:42:42,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test4-1.i that has 3 procedures, 1429 locations, 1 initial locations, 34 loop locations, and 628 error locations. [2025-03-09 00:42:43,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:42:43,019 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;@64308f6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:42:43,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-03-09 00:42:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 1424 states, 794 states have (on average 2.0806045340050376) internal successors, (1652), 1416 states have internal predecessors, (1652), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:42:43,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:43,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:42:43,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 53530594, now seen corresponding path program 1 times [2025-03-09 00:42:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714543471] [2025-03-09 00:42:43,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:43,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:43,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:42:43,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:42:43,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714543471] [2025-03-09 00:42:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714543471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366626885] [2025-03-09 00:42:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:43,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:43,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:43,191 INFO L87 Difference]: Start difference. First operand has 1424 states, 794 states have (on average 2.0806045340050376) internal successors, (1652), 1416 states have internal predecessors, (1652), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:43,943 INFO L93 Difference]: Finished difference Result 1427 states and 1607 transitions. [2025-03-09 00:42:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:42:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:43,963 INFO L225 Difference]: With dead ends: 1427 [2025-03-09 00:42:43,963 INFO L226 Difference]: Without dead ends: 1424 [2025-03-09 00:42:43,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:43,966 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 24 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:43,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2446 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:42:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-03-09 00:42:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1415. [2025-03-09 00:42:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 796 states have (on average 1.9949748743718594) internal successors, (1588), 1407 states have internal predecessors, (1588), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1600 transitions. [2025-03-09 00:42:44,066 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1600 transitions. Word has length 4 [2025-03-09 00:42:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:44,066 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1600 transitions. [2025-03-09 00:42:44,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1600 transitions. [2025-03-09 00:42:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:42:44,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:44,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:42:44,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:42:44,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash -94967656, now seen corresponding path program 1 times [2025-03-09 00:42:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:44,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866972974] [2025-03-09 00:42:44,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:44,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:42:44,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:42:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:44,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:44,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866972974] [2025-03-09 00:42:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866972974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:44,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366932129] [2025-03-09 00:42:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:44,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:44,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:44,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:44,157 INFO L87 Difference]: Start difference. First operand 1415 states and 1600 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:44,886 INFO L93 Difference]: Finished difference Result 1321 states and 1504 transitions. [2025-03-09 00:42:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:42:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:44,890 INFO L225 Difference]: With dead ends: 1321 [2025-03-09 00:42:44,891 INFO L226 Difference]: Without dead ends: 1321 [2025-03-09 00:42:44,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:44,893 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1346 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:44,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 834 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:42:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-09 00:42:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-03-09 00:42:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 796 states have (on average 1.8743718592964824) internal successors, (1492), 1313 states have internal predecessors, (1492), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1504 transitions. [2025-03-09 00:42:44,918 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1504 transitions. Word has length 6 [2025-03-09 00:42:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:44,919 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1504 transitions. [2025-03-09 00:42:44,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1504 transitions. [2025-03-09 00:42:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:42:44,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:44,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:42:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:42:44,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:44,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -94967655, now seen corresponding path program 1 times [2025-03-09 00:42:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:44,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591778780] [2025-03-09 00:42:44,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:44,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:42:44,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:42:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:44,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591778780] [2025-03-09 00:42:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591778780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:45,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162844573] [2025-03-09 00:42:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:45,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:45,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:45,037 INFO L87 Difference]: Start difference. First operand 1321 states and 1504 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:45,859 INFO L93 Difference]: Finished difference Result 1734 states and 1995 transitions. [2025-03-09 00:42:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:42:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:45,864 INFO L225 Difference]: With dead ends: 1734 [2025-03-09 00:42:45,865 INFO L226 Difference]: Without dead ends: 1734 [2025-03-09 00:42:45,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:45,865 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 815 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:45,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1786 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:42:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-03-09 00:42:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1582. [2025-03-09 00:42:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1067 states have (on average 1.8406747891283974) internal successors, (1964), 1574 states have internal predecessors, (1964), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1976 transitions. [2025-03-09 00:42:45,890 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1976 transitions. Word has length 6 [2025-03-09 00:42:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:45,890 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 1976 transitions. [2025-03-09 00:42:45,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1976 transitions. [2025-03-09 00:42:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:42:45,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:45,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:42:45,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:42:45,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:45,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash -96620007, now seen corresponding path program 1 times [2025-03-09 00:42:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956076004] [2025-03-09 00:42:45,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:42:45,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:42:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956076004] [2025-03-09 00:42:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956076004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71484603] [2025-03-09 00:42:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:45,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:45,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:45,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:45,956 INFO L87 Difference]: Start difference. First operand 1582 states and 1976 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:46,292 INFO L93 Difference]: Finished difference Result 2628 states and 3319 transitions. [2025-03-09 00:42:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:42:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:46,299 INFO L225 Difference]: With dead ends: 2628 [2025-03-09 00:42:46,300 INFO L226 Difference]: Without dead ends: 2627 [2025-03-09 00:42:46,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:46,300 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 992 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:46,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 4052 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:42:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-03-09 00:42:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2328. [2025-03-09 00:42:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1813 states have (on average 1.8201875344732488) internal successors, (3300), 2317 states have internal predecessors, (3300), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3318 transitions. [2025-03-09 00:42:46,362 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3318 transitions. Word has length 6 [2025-03-09 00:42:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:46,362 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 3318 transitions. [2025-03-09 00:42:46,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3318 transitions. [2025-03-09 00:42:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 00:42:46,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:46,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:46,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:42:46,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1371545762, now seen corresponding path program 1 times [2025-03-09 00:42:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324056428] [2025-03-09 00:42:46,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:46,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:42:46,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:42:46,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:46,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324056428] [2025-03-09 00:42:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324056428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164331950] [2025-03-09 00:42:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:46,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:46,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:46,432 INFO L87 Difference]: Start difference. First operand 2328 states and 3318 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:47,290 INFO L93 Difference]: Finished difference Result 2403 states and 3424 transitions. [2025-03-09 00:42:47,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:47,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-09 00:42:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:47,297 INFO L225 Difference]: With dead ends: 2403 [2025-03-09 00:42:47,298 INFO L226 Difference]: Without dead ends: 2403 [2025-03-09 00:42:47,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:47,299 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1614 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:47,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1477 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:42:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-09 00:42:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2305. [2025-03-09 00:42:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1813 states have (on average 1.794815223386652) internal successors, (3254), 2294 states have internal predecessors, (3254), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3272 transitions. [2025-03-09 00:42:47,334 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3272 transitions. Word has length 11 [2025-03-09 00:42:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3272 transitions. [2025-03-09 00:42:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3272 transitions. [2025-03-09 00:42:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 00:42:47,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:47,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:47,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:42:47,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1371545763, now seen corresponding path program 1 times [2025-03-09 00:42:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198216290] [2025-03-09 00:42:47,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:42:47,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:42:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:47,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198216290] [2025-03-09 00:42:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198216290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076873432] [2025-03-09 00:42:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:47,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:47,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:47,412 INFO L87 Difference]: Start difference. First operand 2305 states and 3272 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:47,485 INFO L93 Difference]: Finished difference Result 2167 states and 3066 transitions. [2025-03-09 00:42:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-03-09 00:42:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:47,491 INFO L225 Difference]: With dead ends: 2167 [2025-03-09 00:42:47,491 INFO L226 Difference]: Without dead ends: 2167 [2025-03-09 00:42:47,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:47,492 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 60 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:47,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2553 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:42:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-03-09 00:42:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2025-03-09 00:42:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 1687 states have (on average 1.8067575577949022) internal successors, (3048), 2156 states have internal predecessors, (3048), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3066 transitions. [2025-03-09 00:42:47,525 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3066 transitions. Word has length 11 [2025-03-09 00:42:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:47,526 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 3066 transitions. [2025-03-09 00:42:47,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3066 transitions. [2025-03-09 00:42:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 00:42:47,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:47,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:42:47,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr599REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:47,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash -431877771, now seen corresponding path program 1 times [2025-03-09 00:42:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:47,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238446634] [2025-03-09 00:42:47,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:47,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:42:47,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:42:47,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:47,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238446634] [2025-03-09 00:42:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238446634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513062] [2025-03-09 00:42:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:47,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:47,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:47,592 INFO L87 Difference]: Start difference. First operand 2167 states and 3066 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:47,712 INFO L93 Difference]: Finished difference Result 2138 states and 3016 transitions. [2025-03-09 00:42:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-09 00:42:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:47,719 INFO L225 Difference]: With dead ends: 2138 [2025-03-09 00:42:47,719 INFO L226 Difference]: Without dead ends: 2138 [2025-03-09 00:42:47,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:47,720 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 41 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:47,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3776 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:42:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-03-09 00:42:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2132. [2025-03-09 00:42:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1659 states have (on average 1.8034960819770947) internal successors, (2992), 2121 states have internal predecessors, (2992), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 3010 transitions. [2025-03-09 00:42:47,754 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 3010 transitions. Word has length 12 [2025-03-09 00:42:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 3010 transitions. [2025-03-09 00:42:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 3010 transitions. [2025-03-09 00:42:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 00:42:47,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:47,755 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] [2025-03-09 00:42:47,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:42:47,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr585REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 386839083, now seen corresponding path program 1 times [2025-03-09 00:42:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467032647] [2025-03-09 00:42:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 00:42:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 00:42:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467032647] [2025-03-09 00:42:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467032647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147232045] [2025-03-09 00:42:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:47,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:47,920 INFO L87 Difference]: Start difference. First operand 2132 states and 3010 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:48,848 INFO L93 Difference]: Finished difference Result 2380 states and 3177 transitions. [2025-03-09 00:42:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-03-09 00:42:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:48,854 INFO L225 Difference]: With dead ends: 2380 [2025-03-09 00:42:48,854 INFO L226 Difference]: Without dead ends: 2380 [2025-03-09 00:42:48,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:48,855 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 821 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:48,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2506 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:42:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-09 00:42:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2128. [2025-03-09 00:42:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1659 states have (on average 1.7986738999397227) internal successors, (2984), 2117 states have internal predecessors, (2984), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3002 transitions. [2025-03-09 00:42:48,881 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3002 transitions. Word has length 26 [2025-03-09 00:42:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 3002 transitions. [2025-03-09 00:42:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3002 transitions. [2025-03-09 00:42:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:42:48,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:48,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:48,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:42:48,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 626448287, now seen corresponding path program 1 times [2025-03-09 00:42:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858871861] [2025-03-09 00:42:48,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:42:48,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:42:48,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:48,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:48,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858871861] [2025-03-09 00:42:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858871861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95827501] [2025-03-09 00:42:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:48,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:48,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:48,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:48,988 INFO L87 Difference]: Start difference. First operand 2128 states and 3002 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:49,075 INFO L93 Difference]: Finished difference Result 2128 states and 2994 transitions. [2025-03-09 00:42:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:42:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-09 00:42:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:49,081 INFO L225 Difference]: With dead ends: 2128 [2025-03-09 00:42:49,081 INFO L226 Difference]: Without dead ends: 2128 [2025-03-09 00:42:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:49,082 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 21 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3758 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:49,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3758 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:42:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-03-09 00:42:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2025-03-09 00:42:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1659 states have (on average 1.7938517179023508) internal successors, (2976), 2117 states have internal predecessors, (2976), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2994 transitions. [2025-03-09 00:42:49,109 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2994 transitions. Word has length 60 [2025-03-09 00:42:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:49,109 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 2994 transitions. [2025-03-09 00:42:49,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2994 transitions. [2025-03-09 00:42:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 00:42:49,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:49,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:49,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:42:49,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:49,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1721699993, now seen corresponding path program 1 times [2025-03-09 00:42:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834210862] [2025-03-09 00:42:49,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:49,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 00:42:49,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 00:42:49,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:49,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834210862] [2025-03-09 00:42:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834210862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619556192] [2025-03-09 00:42:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:49,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:49,209 INFO L87 Difference]: Start difference. First operand 2128 states and 2994 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:49,284 INFO L93 Difference]: Finished difference Result 1899 states and 2593 transitions. [2025-03-09 00:42:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:49,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-09 00:42:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:49,288 INFO L225 Difference]: With dead ends: 1899 [2025-03-09 00:42:49,288 INFO L226 Difference]: Without dead ends: 1899 [2025-03-09 00:42:49,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:49,289 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 54 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:49,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2526 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:42:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-09 00:42:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1899. [2025-03-09 00:42:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1430 states have (on average 1.8006993006993006) internal successors, (2575), 1888 states have internal predecessors, (2575), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2593 transitions. [2025-03-09 00:42:49,308 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2593 transitions. Word has length 68 [2025-03-09 00:42:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:49,308 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 2593 transitions. [2025-03-09 00:42:49,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2593 transitions. [2025-03-09 00:42:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 00:42:49,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:49,309 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] [2025-03-09 00:42:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:42:49,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr541REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:49,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -666044711, now seen corresponding path program 1 times [2025-03-09 00:42:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277055766] [2025-03-09 00:42:49,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:49,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 00:42:49,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 00:42:49,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:49,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277055766] [2025-03-09 00:42:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277055766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:49,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:49,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:42:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453935098] [2025-03-09 00:42:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:42:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:49,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:42:49,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:42:49,681 INFO L87 Difference]: Start difference. First operand 1899 states and 2593 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:50,533 INFO L93 Difference]: Finished difference Result 1815 states and 2468 transitions. [2025-03-09 00:42:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:42:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2025-03-09 00:42:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:50,537 INFO L225 Difference]: With dead ends: 1815 [2025-03-09 00:42:50,537 INFO L226 Difference]: Without dead ends: 1815 [2025-03-09 00:42:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:42:50,538 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 2259 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:50,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 1007 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:42:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-09 00:42:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1544. [2025-03-09 00:42:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1159 states have (on average 1.6980155306298532) internal successors, (1968), 1533 states have internal predecessors, (1968), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1986 transitions. [2025-03-09 00:42:50,561 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1986 transitions. Word has length 71 [2025-03-09 00:42:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:50,561 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1986 transitions. [2025-03-09 00:42:50,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1986 transitions. [2025-03-09 00:42:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 00:42:50,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:50,563 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] [2025-03-09 00:42:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:42:50,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -107260813, now seen corresponding path program 1 times [2025-03-09 00:42:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919783667] [2025-03-09 00:42:50,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:50,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 00:42:50,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 00:42:50,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:50,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919783667] [2025-03-09 00:42:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919783667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824721532] [2025-03-09 00:42:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:50,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:42:50,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:50,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:42:50,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:50,797 INFO L87 Difference]: Start difference. First operand 1544 states and 1986 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:51,434 INFO L93 Difference]: Finished difference Result 1543 states and 1984 transitions. [2025-03-09 00:42:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:42:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-09 00:42:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:51,441 INFO L225 Difference]: With dead ends: 1543 [2025-03-09 00:42:51,441 INFO L226 Difference]: Without dead ends: 1543 [2025-03-09 00:42:51,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:42:51,442 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 2 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:51,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3296 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:42:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-09 00:42:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1543. [2025-03-09 00:42:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1159 states have (on average 1.6962899050905953) internal successors, (1966), 1532 states have internal predecessors, (1966), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1984 transitions. [2025-03-09 00:42:51,457 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1984 transitions. Word has length 76 [2025-03-09 00:42:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1984 transitions. [2025-03-09 00:42:51,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1984 transitions. [2025-03-09 00:42:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 00:42:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:51,460 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] [2025-03-09 00:42:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:42:51,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:51,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash -107260812, now seen corresponding path program 1 times [2025-03-09 00:42:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41497304] [2025-03-09 00:42:51,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 00:42:51,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 00:42:51,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:51,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41497304] [2025-03-09 00:42:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41497304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005936816] [2025-03-09 00:42:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:51,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:42:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:51,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:42:51,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:51,807 INFO L87 Difference]: Start difference. First operand 1543 states and 1984 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:52,593 INFO L93 Difference]: Finished difference Result 1542 states and 1982 transitions. [2025-03-09 00:42:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:42:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-09 00:42:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:52,598 INFO L225 Difference]: With dead ends: 1542 [2025-03-09 00:42:52,598 INFO L226 Difference]: Without dead ends: 1542 [2025-03-09 00:42:52,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:42:52,598 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 1 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:52,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3311 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:42:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-03-09 00:42:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2025-03-09 00:42:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1157 states have (on average 1.6974935177182369) internal successors, (1964), 1531 states have internal predecessors, (1964), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1982 transitions. [2025-03-09 00:42:52,613 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1982 transitions. Word has length 76 [2025-03-09 00:42:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:52,613 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1982 transitions. [2025-03-09 00:42:52,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1982 transitions. [2025-03-09 00:42:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:42:52,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:52,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:42:52,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1955115344, now seen corresponding path program 1 times [2025-03-09 00:42:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:52,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460831242] [2025-03-09 00:42:52,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:42:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:42:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460831242] [2025-03-09 00:42:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460831242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:52,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:52,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:42:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327252514] [2025-03-09 00:42:52,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:52,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:42:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:52,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:42:52,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:42:52,779 INFO L87 Difference]: Start difference. First operand 1542 states and 1982 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:42:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:53,859 INFO L93 Difference]: Finished difference Result 1560 states and 2012 transitions. [2025-03-09 00:42:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:42:53,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-03-09 00:42:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:53,868 INFO L225 Difference]: With dead ends: 1560 [2025-03-09 00:42:53,869 INFO L226 Difference]: Without dead ends: 1560 [2025-03-09 00:42:53,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:42:53,872 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 6 mSDsluCounter, 4033 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:53,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5211 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:42:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-09 00:42:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1551. [2025-03-09 00:42:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1165 states have (on average 1.6952789699570816) internal successors, (1975), 1538 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-09 00:42:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2002 transitions. [2025-03-09 00:42:53,896 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2002 transitions. Word has length 84 [2025-03-09 00:42:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:53,896 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2002 transitions. [2025-03-09 00:42:53,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:42:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2002 transitions. [2025-03-09 00:42:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 00:42:53,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:53,897 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] [2025-03-09 00:42:53,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:42:53,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:53,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1955115345, now seen corresponding path program 1 times [2025-03-09 00:42:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:53,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178963388] [2025-03-09 00:42:53,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:53,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-09 00:42:53,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 00:42:53,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:53,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:54,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178963388] [2025-03-09 00:42:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178963388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:54,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:42:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408314931] [2025-03-09 00:42:54,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:54,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:42:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:54,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:42:54,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:42:54,296 INFO L87 Difference]: Start difference. First operand 1551 states and 2002 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:42:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:55,247 INFO L93 Difference]: Finished difference Result 1551 states and 2000 transitions. [2025-03-09 00:42:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:42:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-03-09 00:42:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:55,251 INFO L225 Difference]: With dead ends: 1551 [2025-03-09 00:42:55,251 INFO L226 Difference]: Without dead ends: 1551 [2025-03-09 00:42:55,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:42:55,253 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 1 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:55,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4283 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:42:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-09 00:42:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2025-03-09 00:42:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1165 states have (on average 1.6935622317596566) internal successors, (1973), 1538 states have internal predecessors, (1973), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-09 00:42:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2000 transitions. [2025-03-09 00:42:55,267 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2000 transitions. Word has length 84 [2025-03-09 00:42:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:55,267 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2000 transitions. [2025-03-09 00:42:55,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:42:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2000 transitions. [2025-03-09 00:42:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 00:42:55,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:55,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:42:55,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:55,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2068807710, now seen corresponding path program 1 times [2025-03-09 00:42:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50788184] [2025-03-09 00:42:55,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:55,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 00:42:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 00:42:55,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:55,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50788184] [2025-03-09 00:42:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50788184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:42:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155031703] [2025-03-09 00:42:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:55,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:55,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:42:55,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 00:42:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 00:42:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:55,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 00:42:55,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:55,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:42:55,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:42:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:42:55,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:42:55,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:42:55,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:42:55,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:42:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:55,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:42:56,044 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-09 00:42:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-09 00:42:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155031703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:42:56,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:42:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-09 00:42:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775083831] [2025-03-09 00:42:56,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:42:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:42:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:56,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:42:56,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=170, Unknown=5, NotChecked=0, Total=210 [2025-03-09 00:42:56,086 INFO L87 Difference]: Start difference. First operand 1551 states and 2000 transitions. Second operand has 14 states, 12 states have (on average 10.0) internal successors, (120), 13 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:42:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:57,790 INFO L93 Difference]: Finished difference Result 1550 states and 1998 transitions. [2025-03-09 00:42:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:42:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.0) internal successors, (120), 13 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-03-09 00:42:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:57,797 INFO L225 Difference]: With dead ends: 1550 [2025-03-09 00:42:57,797 INFO L226 Difference]: Without dead ends: 1550 [2025-03-09 00:42:57,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=373, Unknown=5, NotChecked=0, Total=462 [2025-03-09 00:42:57,798 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1145 mSDsluCounter, 5488 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 6193 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:57,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 6193 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:42:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-03-09 00:42:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2025-03-09 00:42:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1165 states have (on average 1.6918454935622318) internal successors, (1971), 1537 states have internal predecessors, (1971), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-09 00:42:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1998 transitions. [2025-03-09 00:42:57,818 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1998 transitions. Word has length 85 [2025-03-09 00:42:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:57,818 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 1998 transitions. [2025-03-09 00:42:57,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.0) internal successors, (120), 13 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:42:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1998 transitions. [2025-03-09 00:42:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 00:42:57,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:57,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:57,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:42:58,019 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-09 00:42:58,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:42:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2068807709, now seen corresponding path program 1 times [2025-03-09 00:42:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:42:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918538709] [2025-03-09 00:42:58,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:42:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 00:42:58,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 00:42:58,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:58,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:42:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918538709] [2025-03-09 00:42:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918538709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:42:58,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744834630] [2025-03-09 00:42:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:58,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:42:58,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 00:42:58,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 00:42:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:58,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:42:58,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:58,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:42:58,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:42:58,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:42:58,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:42:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:42:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:42:58,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 00:42:58,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:42:58,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:42:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:42:58,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:42:58,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:42:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:42:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:58,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:42:59,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:42:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744834630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:42:59,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:42:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-09 00:42:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323511192] [2025-03-09 00:42:59,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:42:59,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:42:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:42:59,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:42:59,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-09 00:42:59,035 INFO L87 Difference]: Start difference. First operand 1550 states and 1998 transitions. Second operand has 15 states, 12 states have (on average 10.5) internal successors, (126), 15 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:00,977 INFO L93 Difference]: Finished difference Result 1557 states and 2004 transitions. [2025-03-09 00:43:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:43:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.5) internal successors, (126), 15 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-03-09 00:43:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:00,980 INFO L225 Difference]: With dead ends: 1557 [2025-03-09 00:43:00,980 INFO L226 Difference]: Without dead ends: 1557 [2025-03-09 00:43:00,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:43:00,981 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1139 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 4615 SdHoareTripleChecker+Invalid, 5203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:00,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 4615 Invalid, 5203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5174 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 00:43:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-09 00:43:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1545. [2025-03-09 00:43:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1161 states have (on average 1.6925064599483204) internal successors, (1965), 1533 states have internal predecessors, (1965), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1983 transitions. [2025-03-09 00:43:00,997 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1983 transitions. Word has length 85 [2025-03-09 00:43:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:00,998 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1983 transitions. [2025-03-09 00:43:00,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.5) internal successors, (126), 15 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1983 transitions. [2025-03-09 00:43:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:43:00,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:00,998 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] [2025-03-09 00:43:01,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:43:01,199 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-09 00:43:01,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 790980010, now seen corresponding path program 1 times [2025-03-09 00:43:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649148855] [2025-03-09 00:43:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:43:01,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:43:01,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:01,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649148855] [2025-03-09 00:43:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649148855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:43:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674870272] [2025-03-09 00:43:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:01,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:43:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:01,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:43:01,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:43:01,545 INFO L87 Difference]: Start difference. First operand 1545 states and 1983 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:02,822 INFO L93 Difference]: Finished difference Result 1564 states and 2012 transitions. [2025-03-09 00:43:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:43:02,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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 87 [2025-03-09 00:43:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:02,825 INFO L225 Difference]: With dead ends: 1564 [2025-03-09 00:43:02,825 INFO L226 Difference]: Without dead ends: 1564 [2025-03-09 00:43:02,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:43:02,825 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1153 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 3770 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 3791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:02,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 4819 Invalid, 3791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3770 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:43:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2025-03-09 00:43:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1560. [2025-03-09 00:43:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1175 states have (on average 1.686808510638298) internal successors, (1982), 1546 states have internal predecessors, (1982), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2002 transitions. [2025-03-09 00:43:02,837 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2002 transitions. Word has length 87 [2025-03-09 00:43:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:02,837 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2002 transitions. [2025-03-09 00:43:02,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2002 transitions. [2025-03-09 00:43:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:43:02,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:02,838 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] [2025-03-09 00:43:02,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:43:02,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:02,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash 790980011, now seen corresponding path program 1 times [2025-03-09 00:43:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:02,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773247017] [2025-03-09 00:43:02,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:43:02,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:43:02,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:02,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773247017] [2025-03-09 00:43:03,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773247017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:43:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776859801] [2025-03-09 00:43:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:43:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:03,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:43:03,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:43:03,256 INFO L87 Difference]: Start difference. First operand 1560 states and 2002 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:05,001 INFO L93 Difference]: Finished difference Result 1563 states and 2010 transitions. [2025-03-09 00:43:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:43:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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 87 [2025-03-09 00:43:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:05,003 INFO L225 Difference]: With dead ends: 1563 [2025-03-09 00:43:05,004 INFO L226 Difference]: Without dead ends: 1563 [2025-03-09 00:43:05,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:43:05,004 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 1162 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 4972 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:05,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 4769 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4972 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:43:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-09 00:43:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2025-03-09 00:43:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1175 states have (on average 1.6851063829787234) internal successors, (1980), 1546 states have internal predecessors, (1980), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2000 transitions. [2025-03-09 00:43:05,035 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2000 transitions. Word has length 87 [2025-03-09 00:43:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:05,035 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2000 transitions. [2025-03-09 00:43:05,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2000 transitions. [2025-03-09 00:43:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:43:05,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:05,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:05,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:43:05,036 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:05,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 931476952, now seen corresponding path program 1 times [2025-03-09 00:43:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:05,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513872266] [2025-03-09 00:43:05,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:05,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:43:05,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:43:05,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:05,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513872266] [2025-03-09 00:43:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513872266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973795064] [2025-03-09 00:43:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:05,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:05,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:43:05,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:43:05,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:43:05,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:05,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:05,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:43:05,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:05,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:05,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:05,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:05,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:05,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:05,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:05,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:05,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:05,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:43:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:05,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:05,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-09 00:43:05,814 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-09 00:43:05,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-09 00:43:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973795064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:05,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-03-09 00:43:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124001707] [2025-03-09 00:43:05,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:43:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:05,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:43:05,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=250, Unknown=10, NotChecked=32, Total=342 [2025-03-09 00:43:05,840 INFO L87 Difference]: Start difference. First operand 1560 states and 2000 transitions. Second operand has 16 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:07,938 INFO L93 Difference]: Finished difference Result 1562 states and 2008 transitions. [2025-03-09 00:43:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:43:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-03-09 00:43:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:07,941 INFO L225 Difference]: With dead ends: 1562 [2025-03-09 00:43:07,941 INFO L226 Difference]: Without dead ends: 1562 [2025-03-09 00:43:07,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=488, Unknown=10, NotChecked=46, Total=650 [2025-03-09 00:43:07,941 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1135 mSDsluCounter, 7496 mSDsCounter, 0 mSdLazyCounter, 6429 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 8200 SdHoareTripleChecker+Invalid, 6449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:07,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 8200 Invalid, 6449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6429 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:43:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-03-09 00:43:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1559. [2025-03-09 00:43:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1175 states have (on average 1.6834042553191488) internal successors, (1978), 1545 states have internal predecessors, (1978), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1998 transitions. [2025-03-09 00:43:07,953 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1998 transitions. Word has length 88 [2025-03-09 00:43:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:07,953 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 1998 transitions. [2025-03-09 00:43:07,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1998 transitions. [2025-03-09 00:43:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:43:07,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:07,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:07,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:43:08,155 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-09 00:43:08,155 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:08,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 931476953, now seen corresponding path program 1 times [2025-03-09 00:43:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424494914] [2025-03-09 00:43:08,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:43:08,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:43:08,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424494914] [2025-03-09 00:43:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424494914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333746630] [2025-03-09 00:43:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:08,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:08,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:08,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:08,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:43:08,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:43:08,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:43:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:08,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:43:08,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:08,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:08,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:08,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:08,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:08,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:08,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:08,991 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 51 treesize of output 48 [2025-03-09 00:43:08,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:09,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:09,037 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 70 treesize of output 65 [2025-03-09 00:43:09,045 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 49 treesize of output 30 [2025-03-09 00:43:09,073 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 39 treesize of output 21 [2025-03-09 00:43:09,075 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 32 treesize of output 14 [2025-03-09 00:43:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:09,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:09,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:43:09,136 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 48 treesize of output 52 [2025-03-09 00:43:09,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_prenex_2) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1020 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 13))))) is different from false [2025-03-09 00:43:09,180 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_1020 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 13))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1019 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:43:09,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 13)))) (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_2) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4))))) is different from false [2025-03-09 00:43:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333746630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:09,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2025-03-09 00:43:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096179617] [2025-03-09 00:43:09,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:43:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:09,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:43:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=360, Unknown=3, NotChecked=120, Total=552 [2025-03-09 00:43:09,223 INFO L87 Difference]: Start difference. First operand 1559 states and 1998 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:11,331 INFO L93 Difference]: Finished difference Result 1561 states and 2006 transitions. [2025-03-09 00:43:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:43:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2025-03-09 00:43:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:11,335 INFO L225 Difference]: With dead ends: 1561 [2025-03-09 00:43:11,335 INFO L226 Difference]: Without dead ends: 1561 [2025-03-09 00:43:11,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=543, Unknown=3, NotChecked=150, Total=812 [2025-03-09 00:43:11,335 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1139 mSDsluCounter, 5643 mSDsCounter, 0 mSdLazyCounter, 5851 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 6353 SdHoareTripleChecker+Invalid, 5872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:11,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 6353 Invalid, 5872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5851 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:43:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-03-09 00:43:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1543. [2025-03-09 00:43:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1161 states have (on average 1.6890611541774332) internal successors, (1961), 1531 states have internal predecessors, (1961), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1979 transitions. [2025-03-09 00:43:11,345 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1979 transitions. Word has length 88 [2025-03-09 00:43:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:11,345 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1979 transitions. [2025-03-09 00:43:11,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1979 transitions. [2025-03-09 00:43:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:43:11,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:11,346 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-09 00:43:11,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:43:11,546 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-09 00:43:11,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:11,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1896153066, now seen corresponding path program 1 times [2025-03-09 00:43:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:11,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840389024] [2025-03-09 00:43:11,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:11,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:43:11,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:43:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840389024] [2025-03-09 00:43:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840389024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:43:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147410594] [2025-03-09 00:43:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:43:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:43:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:43:11,991 INFO L87 Difference]: Start difference. First operand 1543 states and 1979 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 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-09 00:43:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:14,360 INFO L93 Difference]: Finished difference Result 1568 states and 2014 transitions. [2025-03-09 00:43:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:43:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 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-09 00:43:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:14,365 INFO L225 Difference]: With dead ends: 1568 [2025-03-09 00:43:14,365 INFO L226 Difference]: Without dead ends: 1568 [2025-03-09 00:43:14,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:43:14,366 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1148 mSDsluCounter, 5068 mSDsCounter, 0 mSdLazyCounter, 6413 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 5778 SdHoareTripleChecker+Invalid, 6432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:14,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 5778 Invalid, 6432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 6413 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-09 00:43:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-09 00:43:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1564. [2025-03-09 00:43:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1181 states have (on average 1.6799322607959357) internal successors, (1984), 1550 states have internal predecessors, (1984), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2004 transitions. [2025-03-09 00:43:14,377 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2004 transitions. Word has length 90 [2025-03-09 00:43:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2004 transitions. [2025-03-09 00:43:14,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 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-09 00:43:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2004 transitions. [2025-03-09 00:43:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:43:14,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:14,378 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-09 00:43:14,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:43:14,379 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1896153065, now seen corresponding path program 1 times [2025-03-09 00:43:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876960889] [2025-03-09 00:43:14,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:14,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:43:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:43:14,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:14,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876960889] [2025-03-09 00:43:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876960889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:14,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:14,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:43:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703028370] [2025-03-09 00:43:14,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:14,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:43:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:14,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:43:14,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:43:14,702 INFO L87 Difference]: Start difference. First operand 1564 states and 2004 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 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-09 00:43:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:16,494 INFO L93 Difference]: Finished difference Result 1567 states and 2012 transitions. [2025-03-09 00:43:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:43:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 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-09 00:43:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:16,496 INFO L225 Difference]: With dead ends: 1567 [2025-03-09 00:43:16,496 INFO L226 Difference]: Without dead ends: 1567 [2025-03-09 00:43:16,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:43:16,497 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1150 mSDsluCounter, 6136 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 6840 SdHoareTripleChecker+Invalid, 5390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 6840 Invalid, 5390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:43:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-09 00:43:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1564. [2025-03-09 00:43:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1181 states have (on average 1.6782387806943269) internal successors, (1982), 1550 states have internal predecessors, (1982), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2002 transitions. [2025-03-09 00:43:16,511 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2002 transitions. Word has length 90 [2025-03-09 00:43:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:16,511 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2002 transitions. [2025-03-09 00:43:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 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-09 00:43:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2002 transitions. [2025-03-09 00:43:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:43:16,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:16,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:16,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 00:43:16,512 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:16,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -152561412, now seen corresponding path program 1 times [2025-03-09 00:43:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061713237] [2025-03-09 00:43:16,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:43:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:43:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:16,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061713237] [2025-03-09 00:43:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061713237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697287694] [2025-03-09 00:43:17,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:17,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:43:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:43:17,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:43:17,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:17,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:17,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 00:43:17,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:17,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:17,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:17,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:17,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:17,376 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 31 treesize of output 32 [2025-03-09 00:43:17,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:17,408 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 70 treesize of output 65 [2025-03-09 00:43:17,410 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 40 treesize of output 23 [2025-03-09 00:43:17,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:17,463 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 70 treesize of output 65 [2025-03-09 00:43:17,468 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 51 treesize of output 32 [2025-03-09 00:43:17,505 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 39 treesize of output 21 [2025-03-09 00:43:17,507 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 34 treesize of output 16 [2025-03-09 00:43:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:17,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:17,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:43:17,639 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 84 treesize of output 88 [2025-03-09 00:43:17,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299))) (or (< 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_8) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 9)) (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))) (forall ((v_ArrVal_1299 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299))) (or (forall ((v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1302) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 9))) (< (+ 4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))) (or (forall ((v_ArrVal_1299 (Array Int Int))) (< (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1300))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:43:17,701 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 601 treesize of output 559 [2025-03-09 00:43:17,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 383 treesize of output 375 [2025-03-09 00:43:17,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 375 treesize of output 367 [2025-03-09 00:43:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 367 treesize of output 359 [2025-03-09 00:43:17,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 359 treesize of output 351 [2025-03-09 00:43:17,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 351 treesize of output 347 [2025-03-09 00:43:17,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1305) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2025-03-09 00:43:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697287694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:17,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-03-09 00:43:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891267710] [2025-03-09 00:43:17,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:43:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:17,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:43:17,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=657, Unknown=2, NotChecked=106, Total=870 [2025-03-09 00:43:17,832 INFO L87 Difference]: Start difference. First operand 1564 states and 2002 transitions. Second operand has 24 states, 21 states have (on average 6.857142857142857) internal successors, (144), 24 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:20,671 INFO L93 Difference]: Finished difference Result 1566 states and 2010 transitions. [2025-03-09 00:43:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:43:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.857142857142857) internal successors, (144), 24 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-03-09 00:43:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:20,674 INFO L225 Difference]: With dead ends: 1566 [2025-03-09 00:43:20,675 INFO L226 Difference]: Without dead ends: 1566 [2025-03-09 00:43:20,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=954, Unknown=2, NotChecked=130, Total=1260 [2025-03-09 00:43:20,676 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1144 mSDsluCounter, 7380 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 8089 SdHoareTripleChecker+Invalid, 7814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:20,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 8089 Invalid, 7814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7791 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-09 00:43:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-09 00:43:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1563. [2025-03-09 00:43:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1181 states have (on average 1.676545300592718) internal successors, (1980), 1549 states have internal predecessors, (1980), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2000 transitions. [2025-03-09 00:43:20,692 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2000 transitions. Word has length 91 [2025-03-09 00:43:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:20,693 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2000 transitions. [2025-03-09 00:43:20,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.857142857142857) internal successors, (144), 24 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2000 transitions. [2025-03-09 00:43:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:43:20,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:20,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:20,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:43:20,894 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-09 00:43:20,894 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:20,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash -152561413, now seen corresponding path program 1 times [2025-03-09 00:43:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157233487] [2025-03-09 00:43:20,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:20,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:43:20,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:43:20,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:20,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157233487] [2025-03-09 00:43:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157233487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352723387] [2025-03-09 00:43:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:21,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:21,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:43:21,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:43:21,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:43:21,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:21,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:21,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 00:43:21,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:21,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:21,511 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:21,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:21,572 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:21,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:21,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:21,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:21,632 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:21,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:21,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:43:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:21,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:21,647 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-09 00:43:21,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1450 (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~mem52#1.base| v_ArrVal_1450))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1451)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:21,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1450 (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_1450))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1451)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:21,693 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-09 00:43:21,693 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 57 treesize of output 56 [2025-03-09 00:43:21,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_1454))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1450)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1451)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-09 00:43:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352723387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:21,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-09 00:43:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940633198] [2025-03-09 00:43:21,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:43:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:21,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:43:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=317, Unknown=11, NotChecked=156, Total=552 [2025-03-09 00:43:21,700 INFO L87 Difference]: Start difference. First operand 1563 states and 2000 transitions. Second operand has 19 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:23,275 INFO L93 Difference]: Finished difference Result 1565 states and 2008 transitions. [2025-03-09 00:43:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:43:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-09 00:43:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:23,280 INFO L225 Difference]: With dead ends: 1565 [2025-03-09 00:43:23,280 INFO L226 Difference]: Without dead ends: 1565 [2025-03-09 00:43:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=627, Unknown=12, NotChecked=220, Total=992 [2025-03-09 00:43:23,281 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1131 mSDsluCounter, 5442 mSDsCounter, 0 mSdLazyCounter, 4837 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 6145 SdHoareTripleChecker+Invalid, 4863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 6145 Invalid, 4863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4837 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:43:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-03-09 00:43:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1541. [2025-03-09 00:43:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1161 states have (on average 1.685615848406546) internal successors, (1957), 1529 states have internal predecessors, (1957), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1975 transitions. [2025-03-09 00:43:23,291 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1975 transitions. Word has length 91 [2025-03-09 00:43:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:23,292 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1975 transitions. [2025-03-09 00:43:23,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1975 transitions. [2025-03-09 00:43:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:43:23,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:23,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:23,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:43:23,494 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-09 00:43:23,494 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 887336483, now seen corresponding path program 1 times [2025-03-09 00:43:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104593385] [2025-03-09 00:43:23,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:23,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:43:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:43:23,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:23,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104593385] [2025-03-09 00:43:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104593385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:43:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461204317] [2025-03-09 00:43:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:23,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:43:23,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:23,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:43:23,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:43:23,934 INFO L87 Difference]: Start difference. First operand 1541 states and 1975 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 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-09 00:43:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:25,752 INFO L93 Difference]: Finished difference Result 1572 states and 2016 transitions. [2025-03-09 00:43:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:43:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 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-09 00:43:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:25,754 INFO L225 Difference]: With dead ends: 1572 [2025-03-09 00:43:25,754 INFO L226 Difference]: Without dead ends: 1572 [2025-03-09 00:43:25,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:43:25,755 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1155 mSDsluCounter, 6127 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 6829 SdHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:25,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 6829 Invalid, 5406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:43:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-09 00:43:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1568. [2025-03-09 00:43:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1187 states have (on average 1.6731255265374894) internal successors, (1986), 1554 states have internal predecessors, (1986), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2006 transitions. [2025-03-09 00:43:25,767 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2006 transitions. Word has length 93 [2025-03-09 00:43:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2006 transitions. [2025-03-09 00:43:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 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-09 00:43:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2006 transitions. [2025-03-09 00:43:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:43:25,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:25,768 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-09 00:43:25,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 00:43:25,769 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:25,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash 887336484, now seen corresponding path program 1 times [2025-03-09 00:43:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292392622] [2025-03-09 00:43:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:25,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:43:25,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:43:25,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:25,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292392622] [2025-03-09 00:43:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292392622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 00:43:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608932603] [2025-03-09 00:43:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:26,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:43:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:26,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:43:26,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:43:26,359 INFO L87 Difference]: Start difference. First operand 1568 states and 2006 transitions. Second operand has 13 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-09 00:43:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:28,169 INFO L93 Difference]: Finished difference Result 1571 states and 2014 transitions. [2025-03-09 00:43:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:43:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 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-09 00:43:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:28,172 INFO L225 Difference]: With dead ends: 1571 [2025-03-09 00:43:28,172 INFO L226 Difference]: Without dead ends: 1571 [2025-03-09 00:43:28,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:43:28,173 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1165 mSDsluCounter, 4060 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:28,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 4769 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4967 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:43:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-09 00:43:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1568. [2025-03-09 00:43:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1187 states have (on average 1.6714406065711878) internal successors, (1984), 1554 states have internal predecessors, (1984), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2004 transitions. [2025-03-09 00:43:28,188 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2004 transitions. Word has length 93 [2025-03-09 00:43:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2004 transitions. [2025-03-09 00:43:28,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 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-09 00:43:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2004 transitions. [2025-03-09 00:43:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:43:28,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:28,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:28,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 00:43:28,189 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -880401455, now seen corresponding path program 1 times [2025-03-09 00:43:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:28,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890150618] [2025-03-09 00:43:28,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:28,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:43:28,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:43:28,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:28,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:28,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890150618] [2025-03-09 00:43:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890150618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409689488] [2025-03-09 00:43:28,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:28,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:43:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:43:28,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:43:28,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:28,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:28,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:43:28,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:28,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:28,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:28,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:28,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:28,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:28,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:29,031 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:29,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:29,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:29,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:29,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:43:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:29,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:29,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (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_1753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:43:29,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (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~mem53#1.base| v_ArrVal_1752))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1753)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:29,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (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_1752))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1753)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:29,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (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~mem52#1.base| v_ArrVal_1751))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1752)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1753)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:29,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (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_1751))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1752)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1753)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:29,147 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-09 00:43:29,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2025-03-09 00:43:29,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1756))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1751)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1752)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1753)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-09 00:43:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409689488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:29,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-03-09 00:43:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024203255] [2025-03-09 00:43:29,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:29,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:43:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:43:29,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=386, Unknown=18, NotChecked=270, Total=756 [2025-03-09 00:43:29,161 INFO L87 Difference]: Start difference. First operand 1568 states and 2004 transitions. Second operand has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:31,252 INFO L93 Difference]: Finished difference Result 1570 states and 2012 transitions. [2025-03-09 00:43:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:43:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-09 00:43:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:31,254 INFO L225 Difference]: With dead ends: 1570 [2025-03-09 00:43:31,254 INFO L226 Difference]: Without dead ends: 1570 [2025-03-09 00:43:31,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=776, Unknown=25, NotChecked=378, Total=1332 [2025-03-09 00:43:31,255 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1133 mSDsluCounter, 7490 mSDsCounter, 0 mSdLazyCounter, 6434 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 8192 SdHoareTripleChecker+Invalid, 6454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:31,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 8192 Invalid, 6454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6434 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:43:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-09 00:43:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1567. [2025-03-09 00:43:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1187 states have (on average 1.6697556866048862) internal successors, (1982), 1553 states have internal predecessors, (1982), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2002 transitions. [2025-03-09 00:43:31,265 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2002 transitions. Word has length 94 [2025-03-09 00:43:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2002 transitions. [2025-03-09 00:43:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2002 transitions. [2025-03-09 00:43:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:43:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:31,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:31,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:43:31,466 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-09 00:43:31,467 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:31,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash -880401454, now seen corresponding path program 1 times [2025-03-09 00:43:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:31,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793272636] [2025-03-09 00:43:31,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:31,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:43:31,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:43:31,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:31,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793272636] [2025-03-09 00:43:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793272636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360060966] [2025-03-09 00:43:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:31,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:31,993 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:31,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:43:32,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:43:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:43:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:32,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-09 00:43:32,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:32,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:32,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:32,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:32,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:43:32,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:43:32,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 00:43:32,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:43:32,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:32,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:43:32,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:32,453 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 00:43:32,453 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 67 treesize of output 39 [2025-03-09 00:43:32,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:32,554 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-09 00:43:32,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2025-03-09 00:43:32,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-03-09 00:43:32,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:32,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:43:32,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:32,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:43:32,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:43:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:32,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:32,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1922 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1922) |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~mem54#1.base| v_ArrVal_1921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:43:32,690 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_1922 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:43:32,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1920))) (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~mem53#1.base| v_ArrVal_1919) .cse0 v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1919) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-03-09 00:43:32,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base|))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1917) .cse0 v_ArrVal_1919) (select (select (store .cse1 .cse0 v_ArrVal_1920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1920))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1917) .cse4 v_ArrVal_1919) .cse5 v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:43:32,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1927))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 (store (select .cse6 .cse0) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1920))) (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~mem50#1.base| v_ArrVal_1928) .cse0 v_ArrVal_1917) .cse1 v_ArrVal_1919) .cse2 v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1922 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1927))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (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~mem50#1.base| v_ArrVal_1928) .cse7 v_ArrVal_1917) .cse8 v_ArrVal_1919) (select (select (store .cse9 .cse8 v_ArrVal_1920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1922))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-09 00:43:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360060966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:32,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-09 00:43:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567094] [2025-03-09 00:43:32,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:32,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:43:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:32,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:43:32,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=689, Unknown=16, NotChecked=290, Total=1122 [2025-03-09 00:43:32,979 INFO L87 Difference]: Start difference. First operand 1567 states and 2002 transitions. Second operand has 25 states, 22 states have (on average 6.818181818181818) internal successors, (150), 25 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:36,751 INFO L93 Difference]: Finished difference Result 1569 states and 2010 transitions. [2025-03-09 00:43:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:43:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.818181818181818) internal successors, (150), 25 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-09 00:43:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:36,755 INFO L225 Difference]: With dead ends: 1569 [2025-03-09 00:43:36,755 INFO L226 Difference]: Without dead ends: 1569 [2025-03-09 00:43:36,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=1121, Unknown=16, NotChecked=370, Total=1722 [2025-03-09 00:43:36,756 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 1135 mSDsluCounter, 6959 mSDsCounter, 0 mSdLazyCounter, 9425 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 9453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:36,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 7666 Invalid, 9453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9425 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-09 00:43:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-09 00:43:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1539. [2025-03-09 00:43:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1161 states have (on average 1.682170542635659) internal successors, (1953), 1527 states have internal predecessors, (1953), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1971 transitions. [2025-03-09 00:43:36,767 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1971 transitions. Word has length 94 [2025-03-09 00:43:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 1971 transitions. [2025-03-09 00:43:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.818181818181818) internal successors, (150), 25 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1971 transitions. [2025-03-09 00:43:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:43:36,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:36,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:36,775 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-09 00:43:36,968 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-09 00:43:36,968 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:36,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1550331171, now seen corresponding path program 1 times [2025-03-09 00:43:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588285312] [2025-03-09 00:43:36,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:36,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:43:36,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:43:36,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:36,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588285312] [2025-03-09 00:43:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588285312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:37,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:43:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43156240] [2025-03-09 00:43:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:37,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:43:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:37,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:43:37,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:43:37,411 INFO L87 Difference]: Start difference. First operand 1539 states and 1971 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:39,043 INFO L93 Difference]: Finished difference Result 1578 states and 2020 transitions. [2025-03-09 00:43:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:43:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-09 00:43:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:39,045 INFO L225 Difference]: With dead ends: 1578 [2025-03-09 00:43:39,045 INFO L226 Difference]: Without dead ends: 1578 [2025-03-09 00:43:39,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:43:39,046 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1150 mSDsluCounter, 5448 mSDsCounter, 0 mSdLazyCounter, 4877 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 6149 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:39,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 6149 Invalid, 4899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4877 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:43:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-09 00:43:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1574. [2025-03-09 00:43:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1195 states have (on average 1.6652719665271967) internal successors, (1990), 1560 states have internal predecessors, (1990), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2010 transitions. [2025-03-09 00:43:39,056 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2010 transitions. Word has length 97 [2025-03-09 00:43:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:39,056 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2010 transitions. [2025-03-09 00:43:39,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2010 transitions. [2025-03-09 00:43:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:43:39,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:39,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 00:43:39,057 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1550331170, now seen corresponding path program 1 times [2025-03-09 00:43:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585580145] [2025-03-09 00:43:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:43:39,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:43:39,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:39,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585580145] [2025-03-09 00:43:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585580145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 00:43:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632998987] [2025-03-09 00:43:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:43:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:39,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:43:39,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:43:39,825 INFO L87 Difference]: Start difference. First operand 1574 states and 2010 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:42,496 INFO L93 Difference]: Finished difference Result 1577 states and 2018 transitions. [2025-03-09 00:43:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:43:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-09 00:43:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:42,498 INFO L225 Difference]: With dead ends: 1577 [2025-03-09 00:43:42,498 INFO L226 Difference]: Without dead ends: 1577 [2025-03-09 00:43:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:43:42,498 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1151 mSDsluCounter, 5581 mSDsCounter, 0 mSdLazyCounter, 7174 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 6283 SdHoareTripleChecker+Invalid, 7199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 6283 Invalid, 7199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7174 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-09 00:43:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-09 00:43:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1574. [2025-03-09 00:43:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1195 states have (on average 1.6635983263598326) internal successors, (1988), 1560 states have internal predecessors, (1988), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2008 transitions. [2025-03-09 00:43:42,510 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2008 transitions. Word has length 97 [2025-03-09 00:43:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:42,510 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2008 transitions. [2025-03-09 00:43:42,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2008 transitions. [2025-03-09 00:43:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:43:42,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:42,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 00:43:42,511 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:42,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1819557493, now seen corresponding path program 1 times [2025-03-09 00:43:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586687884] [2025-03-09 00:43:42,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:42,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:43:42,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:43:42,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:42,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586687884] [2025-03-09 00:43:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586687884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829471417] [2025-03-09 00:43:43,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:43,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:43,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:43:43,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:43:43,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:43:43,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:43,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:43,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 00:43:43,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:43,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:43,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:43,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:43,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:43,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:43,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:43,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:43,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:43,420 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:43,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:43,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:43,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:43,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:43,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:43:43,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:43:43,488 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 00:43:43,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 00:43:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:43,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:43,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 (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_2260) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:43:43,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2260 (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_2259))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2260)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:43,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2260 (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~mem53#1.base| v_ArrVal_2258))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2259)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2260)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:43,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2260 (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~mem52#1.base| v_ArrVal_2257))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2258)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2259)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2260)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:43,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2260 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2257))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2258)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2259)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2260)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:43:43,665 INFO L349 Elim1Store]: treesize reduction 5, result has 97.5 percent of original size [2025-03-09 00:43:43,665 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 201 treesize of output 200 [2025-03-09 00:43:43,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2264))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2257)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2258)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2259)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2260)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-09 00:43:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829471417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:43,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2025-03-09 00:43:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952441698] [2025-03-09 00:43:43,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:43:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:43,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:43:43,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=545, Unknown=18, NotChecked=318, Total=992 [2025-03-09 00:43:43,674 INFO L87 Difference]: Start difference. First operand 1574 states and 2008 transitions. Second operand has 23 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:45,692 INFO L93 Difference]: Finished difference Result 1576 states and 2016 transitions. [2025-03-09 00:43:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:43:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-03-09 00:43:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:45,694 INFO L225 Difference]: With dead ends: 1576 [2025-03-09 00:43:45,694 INFO L226 Difference]: Without dead ends: 1576 [2025-03-09 00:43:45,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1060, Unknown=18, NotChecked=438, Total=1722 [2025-03-09 00:43:45,694 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1134 mSDsluCounter, 6840 mSDsCounter, 0 mSdLazyCounter, 5914 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 7541 SdHoareTripleChecker+Invalid, 5935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:45,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 7541 Invalid, 5935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5914 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:43:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-09 00:43:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1573. [2025-03-09 00:43:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1195 states have (on average 1.6619246861924686) internal successors, (1986), 1559 states have internal predecessors, (1986), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2006 transitions. [2025-03-09 00:43:45,721 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2006 transitions. Word has length 98 [2025-03-09 00:43:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:45,722 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2006 transitions. [2025-03-09 00:43:45,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2006 transitions. [2025-03-09 00:43:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 00:43:45,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:45,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:45,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:43:45,923 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-09 00:43:45,923 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1819557492, now seen corresponding path program 1 times [2025-03-09 00:43:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455490762] [2025-03-09 00:43:45,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:45,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:43:45,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:43:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455490762] [2025-03-09 00:43:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455490762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123599955] [2025-03-09 00:43:46,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:46,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:46,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:46,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:46,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:43:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 00:43:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 00:43:46,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:46,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:46,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-09 00:43:46,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:46,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:43:46,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:43:46,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:46,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:46,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:43:46,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:46,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 00:43:46,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:43:47,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:47,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-09 00:43:47,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:47,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-09 00:43:47,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:47,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-09 00:43:47,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:47,285 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:47,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-09 00:43:47,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:47,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:43:47,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-03-09 00:43:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:43:47,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-03-09 00:43:47,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:43:47,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:43:47,403 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-09 00:43:47,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2025-03-09 00:43:47,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:43:47,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:43:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:47,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:47,693 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~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2446) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2449 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2445))) (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~mem54#1.base| v_ArrVal_2446) .cse1 v_ArrVal_2447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2449) (select (select (store .cse2 .cse1 v_ArrVal_2448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2025-03-09 00:43:48,003 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_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2444 (Array Int Int)) (v_ArrVal_2443 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2444))) (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_2443) .cse1 v_ArrVal_2446) (select (select (store .cse2 .cse1 v_ArrVal_2445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2447))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2444 (Array Int Int)) (v_ArrVal_2443 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (forall ((v_ArrVal_2449 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2444))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2445))) (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_2443) .cse4 v_ArrVal_2446) .cse5 v_ArrVal_2447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2449) (select (select (store .cse6 .cse5 v_ArrVal_2448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2025-03-09 00:43:48,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2444 (Array Int Int)) (v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2441))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2444))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2442) .cse0 v_ArrVal_2443) .cse1 v_ArrVal_2446) (select (select (store .cse2 .cse1 v_ArrVal_2445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2447))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2444 (Array Int Int)) (v_ArrVal_2443 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int))) (or (forall ((v_ArrVal_2449 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2441))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2444))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2445))) (let ((.cse7 (select (select .cse8 |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~mem52#1.base| v_ArrVal_2442) .cse5 v_ArrVal_2443) .cse6 v_ArrVal_2446) .cse7 v_ArrVal_2447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2449) (select (select (store .cse8 .cse7 v_ArrVal_2448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2025-03-09 00:43:49,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:43:49,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2025-03-09 00:43:49,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_29 Int) (v_ArrVal_2448 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2449 Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_31))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_26))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_24))) (let ((.cse3 (select (select .cse5 |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~mem50#1.base| v_prenex_27) .cse0 v_prenex_30) .cse1 v_prenex_28) .cse2 v_prenex_23) .cse3 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_29 v_ArrVal_2449) (select (select (store .cse5 .cse3 v_ArrVal_2448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_29))) (forall ((v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2445 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2444 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2443 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2455))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2441))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2444))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2454) .cse9 v_ArrVal_2442) .cse10 v_ArrVal_2443) .cse11 v_ArrVal_2446) (select (select (store .cse12 .cse11 v_ArrVal_2445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2447))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2025-03-09 00:43:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123599955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:43:49,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-03-09 00:43:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231300217] [2025-03-09 00:43:49,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 00:43:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:49,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 00:43:49,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1364, Unknown=28, NotChecked=316, Total=1892 [2025-03-09 00:43:49,223 INFO L87 Difference]: Start difference. First operand 1573 states and 2006 transitions. Second operand has 32 states, 29 states have (on average 5.448275862068965) internal successors, (158), 30 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:55,439 INFO L93 Difference]: Finished difference Result 1575 states and 2014 transitions. [2025-03-09 00:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:43:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.448275862068965) internal successors, (158), 30 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2025-03-09 00:43:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:55,441 INFO L225 Difference]: With dead ends: 1575 [2025-03-09 00:43:55,441 INFO L226 Difference]: Without dead ends: 1575 [2025-03-09 00:43:55,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2120, Unknown=28, NotChecked=396, Total=2862 [2025-03-09 00:43:55,442 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1137 mSDsluCounter, 8240 mSDsCounter, 0 mSdLazyCounter, 10545 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 8940 SdHoareTripleChecker+Invalid, 10573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 10545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:55,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 8940 Invalid, 10573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 10545 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-09 00:43:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-09 00:43:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1537. [2025-03-09 00:43:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1161 states have (on average 1.6787252368647718) internal successors, (1949), 1525 states have internal predecessors, (1949), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1967 transitions. [2025-03-09 00:43:55,454 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1967 transitions. Word has length 98 [2025-03-09 00:43:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:55,454 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 1967 transitions. [2025-03-09 00:43:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.448275862068965) internal successors, (158), 30 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:43:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1967 transitions. [2025-03-09 00:43:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:43:55,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:55,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:55,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 00:43:55,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-09 00:43:55,659 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr510REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:55,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2131342208, now seen corresponding path program 1 times [2025-03-09 00:43:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229729009] [2025-03-09 00:43:55,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:55,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:43:55,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:43:55,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229729009] [2025-03-09 00:43:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229729009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:43:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746106242] [2025-03-09 00:43:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:43:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:56,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:43:56,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:43:56,076 INFO L87 Difference]: Start difference. First operand 1537 states and 1967 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:58,911 INFO L93 Difference]: Finished difference Result 1582 states and 2022 transitions. [2025-03-09 00:43:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:43:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2025-03-09 00:43:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:58,913 INFO L225 Difference]: With dead ends: 1582 [2025-03-09 00:43:58,913 INFO L226 Difference]: Without dead ends: 1582 [2025-03-09 00:43:58,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:43:58,914 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 1152 mSDsluCounter, 7523 mSDsCounter, 0 mSdLazyCounter, 6372 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 8229 SdHoareTripleChecker+Invalid, 6392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:58,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 8229 Invalid, 6392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6372 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-09 00:43:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-09 00:43:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1578. [2025-03-09 00:43:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1201 states have (on average 1.658617818484596) internal successors, (1992), 1564 states have internal predecessors, (1992), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 00:43:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2012 transitions. [2025-03-09 00:43:58,925 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2012 transitions. Word has length 100 [2025-03-09 00:43:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:58,925 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2012 transitions. [2025-03-09 00:43:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2012 transitions. [2025-03-09 00:43:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:43:58,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:58,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:58,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 00:43:58,926 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr511REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-09 00:43:58,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2131342207, now seen corresponding path program 1 times [2025-03-09 00:43:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:43:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429559221] [2025-03-09 00:43:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:43:58,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:43:58,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:43:58,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:58,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:43:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429559221] [2025-03-09 00:43:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429559221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:59,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-09 00:43:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784736796] [2025-03-09 00:43:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:43:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:43:59,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:43:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:43:59,785 INFO L87 Difference]: Start difference. First operand 1578 states and 2012 transitions. Second operand has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)