./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-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_JEN_nondet_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:37:59,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:37:59,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:37:59,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:37:59,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:37:59,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:37:59,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:37:59,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:37:59,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:37:59,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:37:59,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:37:59,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:37:59,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:37:59,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:37:59,495 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:37:59,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:37:59,496 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:37:59,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:37:59,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:37:59,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:37:59,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:37:59,498 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-09 00:37:59,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:37:59,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:37:59,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:37:59,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:37:59,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:37:59,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-09 00:38:00,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9422cb590/c31cc3b0486c4f3eb239aa483efbb7e7/FLAGc969d80eb [2025-03-09 00:38:01,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:38:01,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-09 00:38:01,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9422cb590/c31cc3b0486c4f3eb239aa483efbb7e7/FLAGc969d80eb [2025-03-09 00:38:01,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9422cb590/c31cc3b0486c4f3eb239aa483efbb7e7 [2025-03-09 00:38:01,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:38:01,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:38:01,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:38:01,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:38:01,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:38:01,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d4df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01, skipping insertion in model container [2025-03-09 00:38:01,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:38:01,615 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:38:01,644 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:38:01,647 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:38:01,649 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:38:01,653 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:38:01,661 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:38:01,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:38:01,677 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:38:01,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:38:01,758 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:38:01,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01 WrapperNode [2025-03-09 00:38:01,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:38:01,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:38:01,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:38:01,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:38:01,763 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:38:01" (1/1) ... [2025-03-09 00:38:01,776 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:38:01" (1/1) ... [2025-03-09 00:38:01,803 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-09 00:38:01,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:38:01,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:38:01,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:38:01,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:38:01,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,857 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-09 00:38:01,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:38:01,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:38:01,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:38:01,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:38:01,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (1/1) ... [2025-03-09 00:38:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:38:01,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:01,916 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:38:01,919 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:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:38:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:38:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:38:01,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:38:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:38:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:38:01,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:38:02,059 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:38:02,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:38:03,240 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2025-03-09 00:38:03,241 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:38:03,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:38:03,289 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 00:38:03,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:38:03 BoogieIcfgContainer [2025-03-09 00:38:03,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:38:03,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:38:03,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:38:03,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:38:03,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:38:01" (1/3) ... [2025-03-09 00:38:03,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738373e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:38:03, skipping insertion in model container [2025-03-09 00:38:03,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:38:01" (2/3) ... [2025-03-09 00:38:03,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738373e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:38:03, skipping insertion in model container [2025-03-09 00:38:03,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:38:03" (3/3) ... [2025-03-09 00:38:03,298 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test1-1.i [2025-03-09 00:38:03,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:38:03,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test1-1.i that has 3 procedures, 737 locations, 1 initial locations, 19 loop locations, and 320 error locations. [2025-03-09 00:38:03,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:38:03,359 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;@240eef48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:38:03,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-03-09 00:38:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:38:03,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:03,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:38:03,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:03,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash 864568488, now seen corresponding path program 1 times [2025-03-09 00:38:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596567973] [2025-03-09 00:38:03,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:38:03,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:38:03,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:03,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:03,479 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:38:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596567973] [2025-03-09 00:38:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596567973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675670060] [2025-03-09 00:38:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:03,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:38:03,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:03,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:38:03,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:38:03,505 INFO L87 Difference]: Start difference. First operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:38:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:03,579 INFO L93 Difference]: Finished difference Result 722 states and 810 transitions. [2025-03-09 00:38:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:38:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-09 00:38:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:03,593 INFO L225 Difference]: With dead ends: 722 [2025-03-09 00:38:03,593 INFO L226 Difference]: Without dead ends: 720 [2025-03-09 00:38:03,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:38:03,597 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:03,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 788 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:38:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-09 00:38:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-03-09 00:38:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 404 states have (on average 1.9851485148514851) internal successors, (802), 715 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 808 transitions. [2025-03-09 00:38:03,677 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 808 transitions. Word has length 5 [2025-03-09 00:38:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 808 transitions. [2025-03-09 00:38:03,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:38:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 808 transitions. [2025-03-09 00:38:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:38:03,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:03,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:38:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:38:03,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:03,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash 864568519, now seen corresponding path program 1 times [2025-03-09 00:38:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672599734] [2025-03-09 00:38:03,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:38:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:38:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:03,733 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:38:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672599734] [2025-03-09 00:38:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672599734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355861260] [2025-03-09 00:38:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:03,734 INFO L87 Difference]: Start difference. First operand 720 states and 808 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:04,190 INFO L93 Difference]: Finished difference Result 672 states and 761 transitions. [2025-03-09 00:38:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 00:38:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:04,193 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:38:04,193 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:38:04,193 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:38:04,194 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 674 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:04,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 436 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:38:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 671. [2025-03-09 00:38:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 404 states have (on average 1.863861386138614) internal successors, (753), 666 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 759 transitions. [2025-03-09 00:38:04,221 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 759 transitions. Word has length 5 [2025-03-09 00:38:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 759 transitions. [2025-03-09 00:38:04,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 759 transitions. [2025-03-09 00:38:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:38:04,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:04,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:38:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:38:04,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 864568520, now seen corresponding path program 1 times [2025-03-09 00:38:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347464914] [2025-03-09 00:38:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:04,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:38:04,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:38:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:04,298 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:38:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347464914] [2025-03-09 00:38:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347464914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:38:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172086940] [2025-03-09 00:38:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:04,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:04,300 INFO L87 Difference]: Start difference. First operand 671 states and 759 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:04,701 INFO L93 Difference]: Finished difference Result 747 states and 841 transitions. [2025-03-09 00:38:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:04,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 00:38:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:04,704 INFO L225 Difference]: With dead ends: 747 [2025-03-09 00:38:04,704 INFO L226 Difference]: Without dead ends: 747 [2025-03-09 00:38:04,704 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:38:04,705 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 413 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:04,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 793 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-09 00:38:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 700. [2025-03-09 00:38:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 444 states have (on average 1.8490990990990992) internal successors, (821), 695 states have internal predecessors, (821), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 827 transitions. [2025-03-09 00:38:04,722 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 827 transitions. Word has length 5 [2025-03-09 00:38:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:04,722 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 827 transitions. [2025-03-09 00:38:04,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 827 transitions. [2025-03-09 00:38:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 00:38:04,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:04,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:38:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:38:04,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:04,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 863731421, now seen corresponding path program 1 times [2025-03-09 00:38:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:04,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698523983] [2025-03-09 00:38:04,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:38:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:38:04,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:04,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:04,762 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:38:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698523983] [2025-03-09 00:38:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698523983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422468688] [2025-03-09 00:38:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:04,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:04,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:04,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:04,764 INFO L87 Difference]: Start difference. First operand 700 states and 827 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:04,842 INFO L93 Difference]: Finished difference Result 1378 states and 1631 transitions. [2025-03-09 00:38:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 00:38:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:04,846 INFO L225 Difference]: With dead ends: 1378 [2025-03-09 00:38:04,846 INFO L226 Difference]: Without dead ends: 1378 [2025-03-09 00:38:04,847 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:38:04,847 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 718 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:04,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1668 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-09 00:38:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 701. [2025-03-09 00:38:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 445 states have (on average 1.847191011235955) internal successors, (822), 696 states have internal predecessors, (822), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 828 transitions. [2025-03-09 00:38:04,870 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 828 transitions. Word has length 5 [2025-03-09 00:38:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:04,870 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 828 transitions. [2025-03-09 00:38:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 828 transitions. [2025-03-09 00:38:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:38:04,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:04,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:04,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:38:04,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:04,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash -413060841, now seen corresponding path program 1 times [2025-03-09 00:38:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:04,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212396034] [2025-03-09 00:38:04,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:04,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:38:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:38:04,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:04,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:04,950 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:38:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212396034] [2025-03-09 00:38:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212396034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:04,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:04,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760489623] [2025-03-09 00:38:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:04,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:04,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:04,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:04,952 INFO L87 Difference]: Start difference. First operand 701 states and 828 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:05,433 INFO L93 Difference]: Finished difference Result 727 states and 881 transitions. [2025-03-09 00:38:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 00:38:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:05,436 INFO L225 Difference]: With dead ends: 727 [2025-03-09 00:38:05,436 INFO L226 Difference]: Without dead ends: 727 [2025-03-09 00:38:05,436 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:38:05,438 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 938 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:05,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 685 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-09 00:38:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 678. [2025-03-09 00:38:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 445 states have (on average 1.7955056179775282) internal successors, (799), 673 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 805 transitions. [2025-03-09 00:38:05,456 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 805 transitions. Word has length 14 [2025-03-09 00:38:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:05,456 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 805 transitions. [2025-03-09 00:38:05,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 805 transitions. [2025-03-09 00:38:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:38:05,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:05,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:05,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:38:05,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -413060840, now seen corresponding path program 1 times [2025-03-09 00:38:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675932923] [2025-03-09 00:38:05,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:38:05,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:38:05,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:05,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:05,598 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:38:05,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:05,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675932923] [2025-03-09 00:38:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675932923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:05,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356657735] [2025-03-09 00:38:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:05,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:05,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:05,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:05,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:05,600 INFO L87 Difference]: Start difference. First operand 678 states and 805 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:06,109 INFO L93 Difference]: Finished difference Result 827 states and 1021 transitions. [2025-03-09 00:38:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:38:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 00:38:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:06,112 INFO L225 Difference]: With dead ends: 827 [2025-03-09 00:38:06,112 INFO L226 Difference]: Without dead ends: 827 [2025-03-09 00:38:06,113 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:38:06,113 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 873 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:06,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1046 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-09 00:38:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 680. [2025-03-09 00:38:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 462 states have (on average 1.6753246753246753) internal successors, (774), 675 states have internal predecessors, (774), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 780 transitions. [2025-03-09 00:38:06,125 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 780 transitions. Word has length 14 [2025-03-09 00:38:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 780 transitions. [2025-03-09 00:38:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:38:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 780 transitions. [2025-03-09 00:38:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:38:06,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:06,127 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:38:06,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:06,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1496352508, now seen corresponding path program 1 times [2025-03-09 00:38:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:06,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900929855] [2025-03-09 00:38:06,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:06,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:38:06,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:38:06,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:06,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:38:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900929855] [2025-03-09 00:38:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900929855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007329256] [2025-03-09 00:38:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:06,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:06,309 INFO L87 Difference]: Start difference. First operand 680 states and 780 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:38:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:06,338 INFO L93 Difference]: Finished difference Result 537 states and 597 transitions. [2025-03-09 00:38:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:06,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2025-03-09 00:38:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:06,340 INFO L225 Difference]: With dead ends: 537 [2025-03-09 00:38:06,341 INFO L226 Difference]: Without dead ends: 537 [2025-03-09 00:38:06,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:38:06,341 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 50 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:06,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:38:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-09 00:38:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-09 00:38:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 342 states have (on average 1.7280701754385965) internal successors, (591), 532 states have internal predecessors, (591), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 597 transitions. [2025-03-09 00:38:06,350 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 597 transitions. Word has length 51 [2025-03-09 00:38:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 597 transitions. [2025-03-09 00:38:06,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:38:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 597 transitions. [2025-03-09 00:38:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:38:06,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:06,353 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] [2025-03-09 00:38:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:38:06,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1163163272, now seen corresponding path program 1 times [2025-03-09 00:38:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181641896] [2025-03-09 00:38:06,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:38:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:38:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:06,439 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:38:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181641896] [2025-03-09 00:38:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181641896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333622859] [2025-03-09 00:38:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:06,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:38:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:06,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:38:06,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:38:06,442 INFO L87 Difference]: Start difference. First operand 537 states and 597 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:38:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:06,519 INFO L93 Difference]: Finished difference Result 550 states and 606 transitions. [2025-03-09 00:38:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:38:06,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-03-09 00:38:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:06,522 INFO L225 Difference]: With dead ends: 550 [2025-03-09 00:38:06,522 INFO L226 Difference]: Without dead ends: 550 [2025-03-09 00:38:06,522 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:38:06,523 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 56 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:06,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1619 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:38:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-09 00:38:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2025-03-09 00:38:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 354 states have (on average 1.692090395480226) internal successors, (599), 544 states have internal predecessors, (599), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 605 transitions. [2025-03-09 00:38:06,534 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 605 transitions. Word has length 63 [2025-03-09 00:38:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:06,534 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 605 transitions. [2025-03-09 00:38:06,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:38:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 605 transitions. [2025-03-09 00:38:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 00:38:06,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:06,535 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:38:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:38:06,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash 451827280, now seen corresponding path program 1 times [2025-03-09 00:38:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9426464] [2025-03-09 00:38:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:06,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 00:38:06,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 00:38:06,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:06,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:06,626 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:38:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9426464] [2025-03-09 00:38:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9426464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:38:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999070000] [2025-03-09 00:38:06,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:38:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:06,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:38:06,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:38:06,627 INFO L87 Difference]: Start difference. First operand 549 states and 605 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:38:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:06,681 INFO L93 Difference]: Finished difference Result 669 states and 759 transitions. [2025-03-09 00:38:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:38:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:38:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:06,685 INFO L225 Difference]: With dead ends: 669 [2025-03-09 00:38:06,685 INFO L226 Difference]: Without dead ends: 669 [2025-03-09 00:38:06,685 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:38:06,685 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 75 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:06,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1128 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:38:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-09 00:38:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2025-03-09 00:38:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 474 states have (on average 1.5886075949367089) internal successors, (753), 664 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 759 transitions. [2025-03-09 00:38:06,694 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 759 transitions. Word has length 71 [2025-03-09 00:38:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:06,694 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 759 transitions. [2025-03-09 00:38:06,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:38:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 759 transitions. [2025-03-09 00:38:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:38:06,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:06,695 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] [2025-03-09 00:38:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:38:06,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -879591588, now seen corresponding path program 1 times [2025-03-09 00:38:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121765976] [2025-03-09 00:38:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:06,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:38:06,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:38:06,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:06,948 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:38:06,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121765976] [2025-03-09 00:38:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121765976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:06,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:06,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221752785] [2025-03-09 00:38:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:06,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:38:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:06,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:38:06,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:38:06,949 INFO L87 Difference]: Start difference. First operand 669 states and 759 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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:38:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:07,396 INFO L93 Difference]: Finished difference Result 668 states and 758 transitions. [2025-03-09 00:38:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2025-03-09 00:38:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:07,400 INFO L225 Difference]: With dead ends: 668 [2025-03-09 00:38:07,400 INFO L226 Difference]: Without dead ends: 668 [2025-03-09 00:38:07,400 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:38:07,402 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:07,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1566 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:38:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-09 00:38:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-09 00:38:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 474 states have (on average 1.5864978902953586) internal successors, (752), 663 states have internal predecessors, (752), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 758 transitions. [2025-03-09 00:38:07,414 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 758 transitions. Word has length 79 [2025-03-09 00:38:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:07,414 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 758 transitions. [2025-03-09 00:38:07,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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:38:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 758 transitions. [2025-03-09 00:38:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 00:38:07,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:07,416 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] [2025-03-09 00:38:07,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:38:07,416 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:07,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash -879591587, now seen corresponding path program 1 times [2025-03-09 00:38:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220314549] [2025-03-09 00:38:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:07,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 00:38:07,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 00:38:07,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:07,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:07,802 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:38:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220314549] [2025-03-09 00:38:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220314549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:38:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836661317] [2025-03-09 00:38:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:38:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:07,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:38:07,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:38:07,805 INFO L87 Difference]: Start difference. First operand 668 states and 758 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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:38:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:08,283 INFO L93 Difference]: Finished difference Result 667 states and 757 transitions. [2025-03-09 00:38:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2025-03-09 00:38:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:08,286 INFO L225 Difference]: With dead ends: 667 [2025-03-09 00:38:08,286 INFO L226 Difference]: Without dead ends: 667 [2025-03-09 00:38:08,287 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:38:08,287 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:08,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1529 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-09 00:38:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-09 00:38:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 473 states have (on average 1.587737843551797) internal successors, (751), 662 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 757 transitions. [2025-03-09 00:38:08,299 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 757 transitions. Word has length 79 [2025-03-09 00:38:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 757 transitions. [2025-03-09 00:38:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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:38:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 757 transitions. [2025-03-09 00:38:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:38:08,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:08,301 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:38:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:38:08,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:08,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715047, now seen corresponding path program 1 times [2025-03-09 00:38:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705055706] [2025-03-09 00:38:08,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:38:08,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:38:08,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:08,490 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:38:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705055706] [2025-03-09 00:38:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705055706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:38:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246261019] [2025-03-09 00:38:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:08,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:38:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:08,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:38:08,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:38:08,491 INFO L87 Difference]: Start difference. First operand 667 states and 757 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:08,976 INFO L93 Difference]: Finished difference Result 679 states and 772 transitions. [2025-03-09 00:38:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:38:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:08,981 INFO L225 Difference]: With dead ends: 679 [2025-03-09 00:38:08,981 INFO L226 Difference]: Without dead ends: 679 [2025-03-09 00:38:08,981 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:38:08,981 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 6 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:08,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2111 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-09 00:38:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 673. [2025-03-09 00:38:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5857740585774058) internal successors, (758), 667 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 767 transitions. [2025-03-09 00:38:08,994 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 767 transitions. Word has length 87 [2025-03-09 00:38:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 767 transitions. [2025-03-09 00:38:08,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 767 transitions. [2025-03-09 00:38:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 00:38:08,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:08,997 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:38:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:38:08,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715046, now seen corresponding path program 1 times [2025-03-09 00:38:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742448758] [2025-03-09 00:38:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:09,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 00:38:09,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 00:38:09,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:09,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:09,390 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:38:09,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:09,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742448758] [2025-03-09 00:38:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742448758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:38:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270037792] [2025-03-09 00:38:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:38:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:38:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:38:09,392 INFO L87 Difference]: Start difference. First operand 673 states and 767 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:09,943 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-09 00:38:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:38:09,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:09,946 INFO L225 Difference]: With dead ends: 673 [2025-03-09 00:38:09,946 INFO L226 Difference]: Without dead ends: 673 [2025-03-09 00:38:09,946 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:38:09,946 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:09,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1990 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:38:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-09 00:38:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-09 00:38:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5836820083682008) internal successors, (757), 667 states have internal predecessors, (757), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-09 00:38:09,957 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 87 [2025-03-09 00:38:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:09,957 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-09 00:38:09,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 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:38:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-09 00:38:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:38:09,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:09,958 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:38:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:38:09,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:09,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683101, now seen corresponding path program 1 times [2025-03-09 00:38:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890429520] [2025-03-09 00:38:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:38:09,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:38:09,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:10,311 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:38:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890429520] [2025-03-09 00:38:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890429520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534000652] [2025-03-09 00:38:10,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:10,314 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:38:10,316 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:38:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:38:10,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:38:10,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:10,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 00:38:10,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:10,484 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:38:10,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:10,596 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:38:10,605 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:38:10,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:10,667 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:38:10,692 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:38:10,695 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:38:10,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:10,739 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-09 00:38:10,739 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:38:10,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2025-03-09 00:38:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534000652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:10,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-09 00:38:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992763846] [2025-03-09 00:38:10,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:10,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:38:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:38:10,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-03-09 00:38:10,754 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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:38:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:12,119 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-09 00:38:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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 88 [2025-03-09 00:38:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:12,121 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:38:12,121 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:38:12,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:38:12,122 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 486 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 3326 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:38:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:38:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-09 00:38:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 478 states have (on average 1.5815899581589958) internal successors, (756), 666 states have internal predecessors, (756), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 765 transitions. [2025-03-09 00:38:12,132 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 765 transitions. Word has length 88 [2025-03-09 00:38:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:12,132 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 765 transitions. [2025-03-09 00:38:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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:38:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 765 transitions. [2025-03-09 00:38:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 00:38:12,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:12,133 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:38:12,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:12,334 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,SelfDestructingSolverStorable13 [2025-03-09 00:38:12,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683100, now seen corresponding path program 1 times [2025-03-09 00:38:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718723727] [2025-03-09 00:38:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:38:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:38:12,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:12,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:12,794 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:38:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718723727] [2025-03-09 00:38:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718723727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277141550] [2025-03-09 00:38:12,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:12,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:12,796 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:38:12,798 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:38:12,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 00:38:12,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 00:38:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:12,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:38:12,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:12,931 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:38:13,009 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:13,009 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:38:13,034 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:38:13,040 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:38:13,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:13,175 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:38:13,180 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:38:13,215 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:38:13,223 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:38:13,238 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:38:13,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:13,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:38:13,335 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:38:13,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_571 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 25))) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)))) is different from false [2025-03-09 00:38:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277141550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:13,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-09 00:38:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724492664] [2025-03-09 00:38:13,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:13,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:38:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:13,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:38:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-03-09 00:38:13,376 INFO L87 Difference]: Start difference. First operand 672 states and 765 transitions. Second operand has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 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:38:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:14,804 INFO L93 Difference]: Finished difference Result 671 states and 764 transitions. [2025-03-09 00:38:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:38:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 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 88 [2025-03-09 00:38:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:14,806 INFO L225 Difference]: With dead ends: 671 [2025-03-09 00:38:14,806 INFO L226 Difference]: Without dead ends: 671 [2025-03-09 00:38:14,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2025-03-09 00:38:14,807 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 528 mSDsluCounter, 2957 mSDsCounter, 0 mSdLazyCounter, 3751 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:14,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3278 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3751 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:38:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-09 00:38:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 665. [2025-03-09 00:38:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 473 states have (on average 1.5835095137420718) internal successors, (749), 660 states have internal predecessors, (749), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 755 transitions. [2025-03-09 00:38:14,816 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 755 transitions. Word has length 88 [2025-03-09 00:38:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 755 transitions. [2025-03-09 00:38:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 2 states have call successors, (2), 1 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:38:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 755 transitions. [2025-03-09 00:38:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:38:14,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:14,817 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:38:14,824 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:38:15,021 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,SelfDestructingSolverStorable14 [2025-03-09 00:38:15,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:15,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 788597119, now seen corresponding path program 1 times [2025-03-09 00:38:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740544754] [2025-03-09 00:38:15,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:15,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:38:15,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:38:15,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:15,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:15,340 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:38:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740544754] [2025-03-09 00:38:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740544754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 00:38:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373203529] [2025-03-09 00:38:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:15,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:38:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:15,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:38:15,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:38:15,342 INFO L87 Difference]: Start difference. First operand 665 states and 755 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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:38:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:16,337 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-09 00:38:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:38:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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:38:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:16,339 INFO L225 Difference]: With dead ends: 675 [2025-03-09 00:38:16,339 INFO L226 Difference]: Without dead ends: 675 [2025-03-09 00:38:16,340 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:38:16,340 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 534 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:16,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3005 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-09 00:38:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 674. [2025-03-09 00:38:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5779625779625779) internal successors, (759), 668 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 768 transitions. [2025-03-09 00:38:16,347 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 768 transitions. Word has length 90 [2025-03-09 00:38:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:16,347 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 768 transitions. [2025-03-09 00:38:16,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 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:38:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 768 transitions. [2025-03-09 00:38:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 00:38:16,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:16,348 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:38:16,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:38:16,348 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 788597120, now seen corresponding path program 1 times [2025-03-09 00:38:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595093105] [2025-03-09 00:38:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:16,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 00:38:16,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 00:38:16,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:16,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595093105] [2025-03-09 00:38:16,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595093105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:16,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:38:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358061847] [2025-03-09 00:38:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:16,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:38:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:16,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:38:16,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:38:16,794 INFO L87 Difference]: Start difference. First operand 674 states and 768 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 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:38:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:17,527 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-09 00:38:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:38:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 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:38:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:17,529 INFO L225 Difference]: With dead ends: 674 [2025-03-09 00:38:17,529 INFO L226 Difference]: Without dead ends: 674 [2025-03-09 00:38:17,529 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:38:17,529 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 554 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:17,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1615 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:38:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-09 00:38:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-09 00:38:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5758835758835759) internal successors, (758), 668 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-09 00:38:17,544 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 90 [2025-03-09 00:38:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-09 00:38:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 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:38:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-09 00:38:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:38:17,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:17,545 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:38:17,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:38:17,545 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921483, now seen corresponding path program 1 times [2025-03-09 00:38:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183309786] [2025-03-09 00:38:17,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:17,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:17,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:17,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:17,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:17,831 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:38:17,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183309786] [2025-03-09 00:38:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183309786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393626817] [2025-03-09 00:38:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:17,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:17,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:17,834 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:38:17,835 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:38:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:17,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:17,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:17,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:17,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:38:17,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:17,981 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:38:18,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:18,055 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:38:18,061 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:38:18,122 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:18,122 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:38:18,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:18,192 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:38:18,202 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:38:18,204 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:38:18,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:18,277 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-09 00:38:18,277 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:38:18,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_824 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-09 00:38:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393626817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:18,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:18,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-03-09 00:38:18,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870841408] [2025-03-09 00:38:18,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:18,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:38:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:18,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:38:18,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=280, Unknown=11, NotChecked=34, Total=380 [2025-03-09 00:38:18,286 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 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:38:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:19,232 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-09 00:38:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 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:38:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:19,234 INFO L225 Difference]: With dead ends: 673 [2025-03-09 00:38:19,234 INFO L226 Difference]: Without dead ends: 673 [2025-03-09 00:38:19,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=533, Unknown=11, NotChecked=48, Total=702 [2025-03-09 00:38:19,235 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 526 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:19,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3055 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-09 00:38:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-09 00:38:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 481 states have (on average 1.5738045738045738) internal successors, (757), 667 states have internal predecessors, (757), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-09 00:38:19,242 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 91 [2025-03-09 00:38:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:19,242 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-09 00:38:19,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 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:38:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-09 00:38:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 00:38:19,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:19,244 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:38:19,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:38:19,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 00:38:19,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:19,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921482, now seen corresponding path program 1 times [2025-03-09 00:38:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061510422] [2025-03-09 00:38:19,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:19,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:19,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:19,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:19,881 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:38:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061510422] [2025-03-09 00:38:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061510422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245370665] [2025-03-09 00:38:19,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:19,883 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:38:19,885 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:38:19,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 00:38:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 00:38:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:20,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:38:20,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:20,028 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:38:20,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:20,104 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:38:20,120 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:38:20,122 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:38:20,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:20,258 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:38:20,262 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:38:20,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:20,325 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:38:20,330 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:38:20,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-03-09 00:38:20,347 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:38:20,364 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:38:20,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:20,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |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~mem53#1.base| v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-09 00:38:20,423 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_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:38:20,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:38:20,479 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:38:20,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_967) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_4) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 37))))) is different from false [2025-03-09 00:38:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245370665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:20,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:20,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2025-03-09 00:38:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202430409] [2025-03-09 00:38:20,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:20,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:38:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:20,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:38:20,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2025-03-09 00:38:20,527 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 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:38:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:22,026 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-09 00:38:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:38:22,026 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 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:38:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:22,028 INFO L225 Difference]: With dead ends: 672 [2025-03-09 00:38:22,028 INFO L226 Difference]: Without dead ends: 672 [2025-03-09 00:38:22,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=640, Unknown=3, NotChecked=162, Total=930 [2025-03-09 00:38:22,028 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 503 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:22,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3453 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:38:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-09 00:38:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 663. [2025-03-09 00:38:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 473 states have (on average 1.5792811839323466) internal successors, (747), 658 states have internal predecessors, (747), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 753 transitions. [2025-03-09 00:38:22,035 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 753 transitions. Word has length 91 [2025-03-09 00:38:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 753 transitions. [2025-03-09 00:38:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 2 states have call successors, (2), 1 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:38:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 753 transitions. [2025-03-09 00:38:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:38:22,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:22,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:22,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:22,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:22,241 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:22,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -373904142, now seen corresponding path program 1 times [2025-03-09 00:38:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:22,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56285513] [2025-03-09 00:38:22,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:22,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:38:22,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:38:22,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:22,613 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:38:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56285513] [2025-03-09 00:38:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56285513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:22,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:22,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:38:22,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900907683] [2025-03-09 00:38:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:22,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:38:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:22,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:38:22,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:38:22,614 INFO L87 Difference]: Start difference. First operand 663 states and 753 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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:38:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:23,619 INFO L93 Difference]: Finished difference Result 676 states and 769 transitions. [2025-03-09 00:38:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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:38:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:23,621 INFO L225 Difference]: With dead ends: 676 [2025-03-09 00:38:23,621 INFO L226 Difference]: Without dead ends: 676 [2025-03-09 00:38:23,621 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:38:23,622 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 537 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:23,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 3304 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-09 00:38:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 675. [2025-03-09 00:38:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5702479338842976) internal successors, (760), 669 states have internal predecessors, (760), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 769 transitions. [2025-03-09 00:38:23,628 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 769 transitions. Word has length 93 [2025-03-09 00:38:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:23,628 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 769 transitions. [2025-03-09 00:38:23,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 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:38:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 769 transitions. [2025-03-09 00:38:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 00:38:23,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:23,631 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:38:23,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:38:23,631 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash -373904141, now seen corresponding path program 1 times [2025-03-09 00:38:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969623980] [2025-03-09 00:38:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:23,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 00:38:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 00:38:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:24,110 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:38:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969623980] [2025-03-09 00:38:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969623980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:38:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269565692] [2025-03-09 00:38:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:38:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:24,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:38:24,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:38:24,112 INFO L87 Difference]: Start difference. First operand 675 states and 769 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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:38:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:24,903 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-09 00:38:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:38:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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:38:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:24,905 INFO L225 Difference]: With dead ends: 675 [2025-03-09 00:38:24,905 INFO L226 Difference]: Without dead ends: 675 [2025-03-09 00:38:24,905 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:38:24,906 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 517 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:24,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1617 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:38:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-09 00:38:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-03-09 00:38:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5681818181818181) internal successors, (759), 669 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 768 transitions. [2025-03-09 00:38:24,912 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 768 transitions. Word has length 93 [2025-03-09 00:38:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:24,912 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 768 transitions. [2025-03-09 00:38:24,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 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:38:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 768 transitions. [2025-03-09 00:38:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:38:24,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:24,913 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:38:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:38:24,913 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:24,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash -930960708, now seen corresponding path program 1 times [2025-03-09 00:38:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:24,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903802626] [2025-03-09 00:38:24,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:24,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:24,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:24,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:24,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:25,248 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:38:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903802626] [2025-03-09 00:38:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903802626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810383024] [2025-03-09 00:38:25,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:25,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:25,252 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:38:25,253 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:38:25,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:25,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:25,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:25,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 00:38:25,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:25,409 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:38:25,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:25,476 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:38:25,480 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:38:25,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:25,557 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:38:25,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:25,588 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:38:25,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:25,618 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:38:25,629 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:38:25,631 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:38:25,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:25,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1241) |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:38:25,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (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_1240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:38:25,718 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-09 00:38:25,718 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:38:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810383024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:25,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-09 00:38:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836779994] [2025-03-09 00:38:25,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:38:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:25,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:38:25,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=380, Unknown=18, NotChecked=82, Total=552 [2025-03-09 00:38:25,755 INFO L87 Difference]: Start difference. First operand 675 states and 768 transitions. Second operand has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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:38:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:26,776 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-09 00:38:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:38:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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:38:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:26,778 INFO L225 Difference]: With dead ends: 674 [2025-03-09 00:38:26,778 INFO L226 Difference]: Without dead ends: 674 [2025-03-09 00:38:26,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=715, Unknown=19, NotChecked=114, Total=992 [2025-03-09 00:38:26,779 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 501 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:26,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3355 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-09 00:38:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-09 00:38:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 484 states have (on average 1.5661157024793388) internal successors, (758), 668 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 00:38:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-09 00:38:26,785 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 94 [2025-03-09 00:38:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:26,785 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-09 00:38:26,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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:38:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-09 00:38:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 00:38:26,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:26,786 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:38:26,795 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:38:26,992 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,SelfDestructingSolverStorable21 [2025-03-09 00:38:26,992 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -930960707, now seen corresponding path program 1 times [2025-03-09 00:38:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275714664] [2025-03-09 00:38:26,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:27,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:27,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:27,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:27,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:27,464 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:38:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275714664] [2025-03-09 00:38:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275714664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951689566] [2025-03-09 00:38:27,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:27,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:27,467 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:38:27,468 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:38:27,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 00:38:27,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 00:38:27,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:27,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:27,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 00:38:27,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:27,665 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:38:27,734 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:38:27,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:27,739 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:38:27,749 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:38:27,752 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:38:27,781 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:38:27,784 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:38:27,855 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:27,855 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:38:27,860 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:38:27,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:27,902 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:38:27,907 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:38:27,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:27,937 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:38:27,942 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:38:27,952 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:38:27,955 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:38:27,958 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:38:27,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:27,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-09 00:38:28,000 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_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:38:28,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:38:28,027 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_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1394) .cse2 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:38:28,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (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~mem51#1.base| v_ArrVal_1401) .cse0 v_ArrVal_1394) (select (select (store .cse1 .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1396))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1393))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1401) .cse3 v_ArrVal_1394) .cse4 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:38:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951689566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:28,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-03-09 00:38:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090721865] [2025-03-09 00:38:28,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:28,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:38:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:28,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:38:28,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-03-09 00:38:28,069 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:38:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:29,254 INFO L93 Difference]: Finished difference Result 681 states and 774 transitions. [2025-03-09 00:38:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:38:29,255 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-09 00:38:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:29,256 INFO L225 Difference]: With dead ends: 681 [2025-03-09 00:38:29,256 INFO L226 Difference]: Without dead ends: 681 [2025-03-09 00:38:29,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-03-09 00:38:29,257 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 500 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:29,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2325 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:38:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-09 00:38:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 666. [2025-03-09 00:38:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 477 states have (on average 1.5723270440251573) internal successors, (750), 660 states have internal predecessors, (750), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 756 transitions. [2025-03-09 00:38:29,263 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 756 transitions. Word has length 94 [2025-03-09 00:38:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 756 transitions. [2025-03-09 00:38:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:38:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 756 transitions. [2025-03-09 00:38:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:38:29,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:29,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:29,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:29,464 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669896, now seen corresponding path program 1 times [2025-03-09 00:38:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:29,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601158224] [2025-03-09 00:38:29,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:38:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:38:29,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:29,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:29,816 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:38:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601158224] [2025-03-09 00:38:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601158224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:29,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:38:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146870797] [2025-03-09 00:38:29,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:29,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:38:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:29,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:38:29,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:38:29,818 INFO L87 Difference]: Start difference. First operand 666 states and 756 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:38:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:30,908 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-09 00:38:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:38:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-09 00:38:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:30,909 INFO L225 Difference]: With dead ends: 685 [2025-03-09 00:38:30,909 INFO L226 Difference]: Without dead ends: 685 [2025-03-09 00:38:30,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:38:30,910 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 536 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:30,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3599 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:38:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-09 00:38:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 681. [2025-03-09 00:38:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.560081466395112) internal successors, (766), 674 states have internal predecessors, (766), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 773 transitions. [2025-03-09 00:38:30,916 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 773 transitions. Word has length 96 [2025-03-09 00:38:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:30,916 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 773 transitions. [2025-03-09 00:38:30,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:38:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 773 transitions. [2025-03-09 00:38:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 00:38:30,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:30,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 00:38:30,917 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669895, now seen corresponding path program 1 times [2025-03-09 00:38:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7639914] [2025-03-09 00:38:30,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:30,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 00:38:30,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 00:38:30,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:30,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:31,394 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:38:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7639914] [2025-03-09 00:38:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7639914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:31,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 00:38:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47223949] [2025-03-09 00:38:31,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:38:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:31,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:38:31,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:38:31,396 INFO L87 Difference]: Start difference. First operand 681 states and 773 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:38:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:32,378 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-09 00:38:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:38:32,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-09 00:38:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:32,380 INFO L225 Difference]: With dead ends: 684 [2025-03-09 00:38:32,381 INFO L226 Difference]: Without dead ends: 684 [2025-03-09 00:38:32,381 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:38:32,381 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 556 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:32,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2067 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-09 00:38:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 681. [2025-03-09 00:38:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.5580448065173116) internal successors, (765), 674 states have internal predecessors, (765), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 772 transitions. [2025-03-09 00:38:32,388 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 772 transitions. Word has length 96 [2025-03-09 00:38:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:32,388 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 772 transitions. [2025-03-09 00:38:32,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:38:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 772 transitions. [2025-03-09 00:38:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:38:32,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:32,389 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:38:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:38:32,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195858, now seen corresponding path program 1 times [2025-03-09 00:38:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680130747] [2025-03-09 00:38:32,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:32,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:32,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:32,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:32,712 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:38:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680130747] [2025-03-09 00:38:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680130747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622409553] [2025-03-09 00:38:32,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:32,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:32,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:32,714 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:38:32,715 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:38:32,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:32,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 00:38:32,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:32,869 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:38:32,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:32,928 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:38:32,931 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:38:32,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:32,987 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:38:33,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:33,015 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:38:33,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:33,044 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:38:33,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:33,070 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:38:33,077 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:38:33,078 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:38:33,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:33,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (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_1700))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:38:33,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (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_1699))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1700)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:38:37,238 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-09 00:38:37,238 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:38:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622409553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:37,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-03-09 00:38:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362621556] [2025-03-09 00:38:37,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:38:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:37,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:38:37,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=515, Unknown=45, NotChecked=98, Total=756 [2025-03-09 00:38:37,281 INFO L87 Difference]: Start difference. First operand 681 states and 772 transitions. Second operand has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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:38:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:38,629 INFO L93 Difference]: Finished difference Result 683 states and 776 transitions. [2025-03-09 00:38:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:38:38,630 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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 97 [2025-03-09 00:38:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:38,631 INFO L225 Difference]: With dead ends: 683 [2025-03-09 00:38:38,631 INFO L226 Difference]: Without dead ends: 683 [2025-03-09 00:38:38,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=189, Invalid=960, Unknown=49, NotChecked=134, Total=1332 [2025-03-09 00:38:38,632 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 518 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:38,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3329 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:38:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-09 00:38:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2025-03-09 00:38:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 491 states have (on average 1.5560081466395113) internal successors, (764), 673 states have internal predecessors, (764), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 771 transitions. [2025-03-09 00:38:38,637 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 771 transitions. Word has length 97 [2025-03-09 00:38:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 771 transitions. [2025-03-09 00:38:38,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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:38:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 771 transitions. [2025-03-09 00:38:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 00:38:38,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:38,638 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:38:38,645 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:38:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:38,839 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195857, now seen corresponding path program 1 times [2025-03-09 00:38:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125937221] [2025-03-09 00:38:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:38,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:39,364 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:38:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125937221] [2025-03-09 00:38:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125937221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447312602] [2025-03-09 00:38:39,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:39,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:39,367 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:38:39,368 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:38:39,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 00:38:39,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 00:38:39,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:39,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:39,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 00:38:39,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:39,541 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:38:39,626 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:38:39,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:39,635 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:38:39,657 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:38:39,660 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:38:39,712 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:38:39,716 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:38:39,788 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:39,788 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:38:39,796 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:38:39,854 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:39,854 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:38:39,858 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:38:39,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:39,905 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:38:39,908 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:38:39,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:39,956 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:38:39,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2025-03-09 00:38:39,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:38:40,001 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 30 treesize of output 12 [2025-03-09 00:38:40,020 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:38:40,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:40,165 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-03-09 00:38:40,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0)))) (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1868))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1867))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse3 .cse4 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2025-03-09 00:38:40,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse5 v_ArrVal_1868))) (or (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1867))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse8 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (< (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))))))) is different from false [2025-03-09 00:38:40,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447312602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:40,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-09 00:38:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667921787] [2025-03-09 00:38:40,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:40,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:38:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:40,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:38:40,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=793, Unknown=20, NotChecked=180, Total=1122 [2025-03-09 00:38:40,550 INFO L87 Difference]: Start difference. First operand 680 states and 771 transitions. Second operand has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 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:38:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:42,490 INFO L93 Difference]: Finished difference Result 682 states and 775 transitions. [2025-03-09 00:38:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:38:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-03-09 00:38:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:42,492 INFO L225 Difference]: With dead ends: 682 [2025-03-09 00:38:42,492 INFO L226 Difference]: Without dead ends: 682 [2025-03-09 00:38:42,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=1186, Unknown=20, NotChecked=222, Total=1640 [2025-03-09 00:38:42,493 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 504 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 3939 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:42,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 3073 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3939 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-09 00:38:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-09 00:38:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 664. [2025-03-09 00:38:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 477 states have (on average 1.5681341719077568) internal successors, (748), 658 states have internal predecessors, (748), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 754 transitions. [2025-03-09 00:38:42,499 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 754 transitions. Word has length 97 [2025-03-09 00:38:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:42,499 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 754 transitions. [2025-03-09 00:38:42,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 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:38:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 754 transitions. [2025-03-09 00:38:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:38:42,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:42,500 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:38:42,507 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:38:42,704 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,SelfDestructingSolverStorable26 [2025-03-09 00:38:42,704 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash -279115982, now seen corresponding path program 1 times [2025-03-09 00:38:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:42,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430968828] [2025-03-09 00:38:42,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:42,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:38:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:38:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:38:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430968828] [2025-03-09 00:38:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430968828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:38:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75403339] [2025-03-09 00:38:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:38:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:43,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:38:43,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:38:43,215 INFO L87 Difference]: Start difference. First operand 664 states and 754 transitions. Second operand has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 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:38:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:44,290 INFO L93 Difference]: Finished difference Result 687 states and 780 transitions. [2025-03-09 00:38:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:38:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 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:38:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:44,292 INFO L225 Difference]: With dead ends: 687 [2025-03-09 00:38:44,292 INFO L226 Difference]: Without dead ends: 687 [2025-03-09 00:38:44,292 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:38:44,293 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 560 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:44,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2436 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 00:38:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-09 00:38:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 683. [2025-03-09 00:38:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5515151515151515) internal successors, (768), 676 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 775 transitions. [2025-03-09 00:38:44,300 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 775 transitions. Word has length 100 [2025-03-09 00:38:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:44,300 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 775 transitions. [2025-03-09 00:38:44,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 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:38:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 775 transitions. [2025-03-09 00:38:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 00:38:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:44,301 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:38:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:38:44,301 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -279115981, now seen corresponding path program 1 times [2025-03-09 00:38:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459146765] [2025-03-09 00:38:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:44,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 00:38:44,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 00:38:44,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:45,078 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:38:45,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:45,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459146765] [2025-03-09 00:38:45,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459146765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:45,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-09 00:38:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980845342] [2025-03-09 00:38:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:45,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:38:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:45,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:38:45,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:38:45,079 INFO L87 Difference]: Start difference. First operand 683 states and 775 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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:38:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:46,507 INFO L93 Difference]: Finished difference Result 686 states and 779 transitions. [2025-03-09 00:38:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:38:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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:38:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:46,510 INFO L225 Difference]: With dead ends: 686 [2025-03-09 00:38:46,510 INFO L226 Difference]: Without dead ends: 686 [2025-03-09 00:38:46,510 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:38:46,510 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 538 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:46,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2320 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:38:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-09 00:38:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2025-03-09 00:38:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5494949494949495) internal successors, (767), 676 states have internal predecessors, (767), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 774 transitions. [2025-03-09 00:38:46,515 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 774 transitions. Word has length 100 [2025-03-09 00:38:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:46,516 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 774 transitions. [2025-03-09 00:38:46,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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:38:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 774 transitions. [2025-03-09 00:38:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:38:46,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:46,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 00:38:46,516 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711528, now seen corresponding path program 1 times [2025-03-09 00:38:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993609913] [2025-03-09 00:38:46,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:46,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:38:46,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:38:46,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:46,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:46,995 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:38:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993609913] [2025-03-09 00:38:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993609913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761770571] [2025-03-09 00:38:46,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:46,997 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:38:46,997 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:38:47,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:38:47,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:38:47,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:47,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:47,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 00:38:47,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:47,166 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:38:47,232 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:47,233 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:38:47,241 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:38:47,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:47,315 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:38:47,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:47,348 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:38:47,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:47,382 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:38:47,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:47,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-09 00:38:47,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:47,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:38:47,483 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:38:47,500 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 00:38:47,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 00:38:47,502 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:38:47,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:47,966 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-09 00:38:47,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-03-09 00:38:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761770571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:48,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-03-09 00:38:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142609053] [2025-03-09 00:38:48,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:48,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:38:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:48,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:38:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=985, Unknown=55, NotChecked=0, Total=1190 [2025-03-09 00:38:48,041 INFO L87 Difference]: Start difference. First operand 683 states and 774 transitions. Second operand has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 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:38:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:49,742 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-09 00:38:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:38:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-03-09 00:38:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:49,744 INFO L225 Difference]: With dead ends: 685 [2025-03-09 00:38:49,744 INFO L226 Difference]: Without dead ends: 685 [2025-03-09 00:38:49,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=1651, Unknown=55, NotChecked=0, Total=1980 [2025-03-09 00:38:49,744 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 497 mSDsluCounter, 3897 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:49,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 4215 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:38:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-09 00:38:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2025-03-09 00:38:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 495 states have (on average 1.5474747474747474) internal successors, (766), 675 states have internal predecessors, (766), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:38:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 773 transitions. [2025-03-09 00:38:49,750 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 773 transitions. Word has length 101 [2025-03-09 00:38:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 773 transitions. [2025-03-09 00:38:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 2 states have call successors, (2), 1 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:38:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 773 transitions. [2025-03-09 00:38:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 00:38:49,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:49,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:49,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 00:38:49,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:49,951 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:49,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711529, now seen corresponding path program 1 times [2025-03-09 00:38:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423323151] [2025-03-09 00:38:49,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:49,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:38:49,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:38:49,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:49,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:50,717 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:38:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423323151] [2025-03-09 00:38:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423323151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052580514] [2025-03-09 00:38:50,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:50,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:38:50,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:38:50,719 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:38:50,720 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:38:50,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 00:38:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 00:38:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:50,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-09 00:38:50,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:38:50,917 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:38:50,993 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:38:50,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:50,999 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:38:51,005 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:38:51,009 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:38:51,046 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:38:51,049 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:38:51,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:51,123 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:38:51,128 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:38:51,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:51,177 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:38:51,180 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:38:51,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:51,227 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:38:51,230 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:38:51,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:51,287 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:38:51,292 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:38:51,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:38:51,345 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:38:51,348 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:38:51,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:38:51,366 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:38:51,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:38:51,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-09 00:38:51,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:38:51,378 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:38:51,380 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:38:51,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:38:51,626 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~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2393) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (forall ((v_ArrVal_2397 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394))) (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~mem55#1.base| v_ArrVal_2393) .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2397) (select (select (store .cse2 .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-03-09 00:38:51,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:38:51,755 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 172 treesize of output 190 [2025-03-09 00:38:51,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2391))) (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~mem54#1.base| v_ArrVal_2392) .cse0 v_ArrVal_2393) (select (select (store .cse1 .cse0 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_22))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_prenex_25))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ 3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_27) .cse3 v_prenex_26) .cse4 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse5 .cse4 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (= v_prenex_23 |c_ULTIMATE.start_main_#t~mem54#1.base|))))) is different from false [2025-03-09 00:38:51,818 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 (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2391))) (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_2392) .cse1 v_ArrVal_2393) (select (select (store .cse2 .cse1 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_22))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_prenex_25))) (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_prenex_27) .cse4 v_prenex_26) .cse5 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 3) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse6 .cse5 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (= .cse0 v_prenex_23)))))) is different from false [2025-03-09 00:38:51,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2389 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= .cse0 v_prenex_23) (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse5 (store .cse6 .cse0 v_prenex_22))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_prenex_25))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ 3 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2389) .cse0 v_prenex_27) .cse1 v_prenex_26) .cse2 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse4 .cse2 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2391))) (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~mem53#1.base| v_ArrVal_2389) .cse7 v_ArrVal_2392) .cse8 v_ArrVal_2393) (select (select (store .cse9 .cse8 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))))) is different from false [2025-03-09 00:38:55,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2390))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2391))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2389) .cse1 v_ArrVal_2392) .cse2 v_ArrVal_2393) (select (select (store .cse3 .cse2 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2389 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2390))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse10 (store .cse11 .cse6 v_prenex_22))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_prenex_25))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2389) .cse6 v_prenex_27) .cse7 v_prenex_26) .cse8 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse9 .cse8 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (= .cse6 v_prenex_23)))))))) is different from false [2025-03-09 00:38:56,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2390))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2391))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse0 v_ArrVal_2389) .cse1 v_ArrVal_2392) .cse2 v_ArrVal_2393) (select (select (store .cse3 .cse2 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2395))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2390))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse12 (store .cse13 .cse8 v_prenex_22))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse7 v_ArrVal_2389) .cse8 v_prenex_27) .cse9 v_prenex_26) .cse10 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse11 .cse10 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (= v_prenex_23 .cse8))))))))) is different from false [2025-03-09 00:38:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052580514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:38:56,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:38:56,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2025-03-09 00:38:56,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843884419] [2025-03-09 00:38:56,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:38:56,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:38:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:38:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=814, Unknown=14, NotChecked=378, Total=1332 [2025-03-09 00:38:56,166 INFO L87 Difference]: Start difference. First operand 682 states and 773 transitions. Second operand has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:38:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:38:58,493 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-09 00:38:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:38:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-09 00:38:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:38:58,495 INFO L225 Difference]: With dead ends: 684 [2025-03-09 00:38:58,495 INFO L226 Difference]: Without dead ends: 684 [2025-03-09 00:38:58,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=243, Invalid=1573, Unknown=14, NotChecked=522, Total=2352 [2025-03-09 00:38:58,496 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 522 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:38:58,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3049 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3949 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-09 00:38:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-09 00:38:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 662. [2025-03-09 00:38:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 477 states have (on average 1.5639412997903563) internal successors, (746), 656 states have internal predecessors, (746), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:38:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 752 transitions. [2025-03-09 00:38:58,501 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 752 transitions. Word has length 101 [2025-03-09 00:38:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:38:58,501 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 752 transitions. [2025-03-09 00:38:58,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:38:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 752 transitions. [2025-03-09 00:38:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 00:38:58,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:38:58,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:38:58,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:38:58,703 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,SelfDestructingSolverStorable30 [2025-03-09 00:38:58,703 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:38:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:38:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -87123703, now seen corresponding path program 1 times [2025-03-09 00:38:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:38:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834272139] [2025-03-09 00:38:58,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:38:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:38:58,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 00:38:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 00:38:58,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:38:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:38:59,086 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:38:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:38:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834272139] [2025-03-09 00:38:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834272139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:38:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:38:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:38:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618936379] [2025-03-09 00:38:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:38:59,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:38:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:38:59,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:38:59,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:38:59,087 INFO L87 Difference]: Start difference. First operand 662 states and 752 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:00,293 INFO L93 Difference]: Finished difference Result 688 states and 781 transitions. [2025-03-09 00:39:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:39:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-03-09 00:39:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:00,295 INFO L225 Difference]: With dead ends: 688 [2025-03-09 00:39:00,295 INFO L226 Difference]: Without dead ends: 688 [2025-03-09 00:39:00,296 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:39:00,296 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 501 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:00,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2713 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:39:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-09 00:39:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 684. [2025-03-09 00:39:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 498 states have (on average 1.5441767068273093) internal successors, (769), 677 states have internal predecessors, (769), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 776 transitions. [2025-03-09 00:39:00,305 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 776 transitions. Word has length 103 [2025-03-09 00:39:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:00,305 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 776 transitions. [2025-03-09 00:39:00,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 776 transitions. [2025-03-09 00:39:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 00:39:00,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:00,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 00:39:00,306 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:00,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash -87123702, now seen corresponding path program 1 times [2025-03-09 00:39:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:00,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219211187] [2025-03-09 00:39:00,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:00,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 00:39:00,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 00:39:00,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:00,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:01,107 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:39:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219211187] [2025-03-09 00:39:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219211187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-09 00:39:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787170457] [2025-03-09 00:39:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:39:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:01,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:39:01,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:39:01,108 INFO L87 Difference]: Start difference. First operand 684 states and 776 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:02,335 INFO L93 Difference]: Finished difference Result 687 states and 780 transitions. [2025-03-09 00:39:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 00:39:02,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-03-09 00:39:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:02,337 INFO L225 Difference]: With dead ends: 687 [2025-03-09 00:39:02,337 INFO L226 Difference]: Without dead ends: 687 [2025-03-09 00:39:02,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-03-09 00:39:02,337 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 557 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:02,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1940 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:39:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-09 00:39:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2025-03-09 00:39:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 498 states have (on average 1.5421686746987953) internal successors, (768), 677 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 775 transitions. [2025-03-09 00:39:02,343 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 775 transitions. Word has length 103 [2025-03-09 00:39:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:02,344 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 775 transitions. [2025-03-09 00:39:02,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 775 transitions. [2025-03-09 00:39:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:39:02,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:02,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 00:39:02,344 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1728617901, now seen corresponding path program 1 times [2025-03-09 00:39:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975448471] [2025-03-09 00:39:02,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:02,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:39:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:39:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:39:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975448471] [2025-03-09 00:39:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975448471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:02,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:39:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145530083] [2025-03-09 00:39:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:39:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:39:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:39:02,571 INFO L87 Difference]: Start difference. First operand 684 states and 775 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:02,969 INFO L93 Difference]: Finished difference Result 683 states and 774 transitions. [2025-03-09 00:39:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:39:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2025-03-09 00:39:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:02,971 INFO L225 Difference]: With dead ends: 683 [2025-03-09 00:39:02,971 INFO L226 Difference]: Without dead ends: 683 [2025-03-09 00:39:02,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:39:02,971 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 2 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:02,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1631 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:39:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-09 00:39:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-09 00:39:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 498 states have (on average 1.5401606425702812) internal successors, (767), 676 states have internal predecessors, (767), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 774 transitions. [2025-03-09 00:39:02,976 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 774 transitions. Word has length 104 [2025-03-09 00:39:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:02,976 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 774 transitions. [2025-03-09 00:39:02,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:39:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 774 transitions. [2025-03-09 00:39:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 00:39:02,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:02,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:02,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 00:39:02,977 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1728617900, now seen corresponding path program 1 times [2025-03-09 00:39:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:02,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665977043] [2025-03-09 00:39:02,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:02,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:39:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:39:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:03,845 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:39:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665977043] [2025-03-09 00:39:03,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665977043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183444140] [2025-03-09 00:39:03,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:03,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:03,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:03,847 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:39:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 00:39:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 00:39:04,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:04,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:04,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 00:39:04,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:04,051 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:39:04,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:39:04,218 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:39:04,238 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:39:04,241 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:39:04,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:04,401 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:39:04,405 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:39:04,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:04,514 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:39:04,518 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:39:04,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:39:04,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2025-03-09 00:39:04,619 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:39:04,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:04,684 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:39:04,690 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:39:04,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:04,754 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:39:04,757 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:39:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:39:04,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 00:39:04,831 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-09 00:39:04,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-09 00:39:04,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:04,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:39:04,876 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:39:04,890 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:39:04,893 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:39:04,917 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:39:04,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:05,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2859 Int) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2858))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2857) .cse0 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse2 .cse0 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2861 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2857) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:39:05,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base|)) (.cse6 (+ 4 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2852 Int) (v_ArrVal_2861 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| (store .cse5 .cse6 v_ArrVal_2852)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2856))) (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~mem54#1.base| v_ArrVal_2854) .cse0 v_ArrVal_2855) .cse1 v_ArrVal_2857) (select (select (store .cse2 .cse1 v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2861))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2852 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2859 Int) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| (store .cse5 .cse6 v_ArrVal_2852)))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2856))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2858))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2854) .cse7 v_ArrVal_2855) .cse8 v_ArrVal_2857) .cse9 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse10 .cse9 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2025-03-09 00:39:10,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:39:10,726 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 1046 treesize of output 1064 [2025-03-09 00:39:10,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2859 Int) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2852 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2850))) (or (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2851))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2856))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2858))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store .cse0 .cse1 v_ArrVal_2854) .cse2 v_ArrVal_2855) .cse3 v_ArrVal_2857) .cse4 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse6 .cse4 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| |c_ULTIMATE.start_main_#t~mem53#1.base|)))) (forall ((v_prenex_37 Int) (v_prenex_32 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_40 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_39))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37) (< 0 (+ (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_38))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 (store (select .cse16 .cse11) (+ v_prenex_37 4) v_prenex_40)))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_34))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store .cse10 .cse11 v_prenex_36) .cse12 v_prenex_35) .cse13 v_prenex_33) (select (select (store .cse14 .cse13 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41))))))) is different from false [2025-03-09 00:39:11,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |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|) .cse6))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2859 Int) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2852 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2850))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2851))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2856))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2858))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ (select (select (store (store (store (store .cse1 .cse2 v_ArrVal_2854) .cse3 v_ArrVal_2855) .cse4 v_ArrVal_2857) .cse5 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2859) (select (select (store .cse7 .cse5 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))) (< (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|)))) (forall ((v_prenex_37 Int) (v_prenex_32 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_40 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_39))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_37) (< 0 (+ 41 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_38))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 (store (select .cse17 .cse12) (+ v_prenex_37 4) v_prenex_40)))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_prenex_34))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store .cse11 .cse12 v_prenex_36) .cse13 v_prenex_35) .cse14 v_prenex_33) (select (select (store .cse15 .cse14 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2025-03-09 00:39:11,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:39:11,152 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 4318 treesize of output 4322 [2025-03-09 00:39:11,491 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_37 Int) (v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_40 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2866))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2867) .cse9 v_prenex_39))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_37) (< 0 (+ 41 (select (select (let ((.cse7 (store .cse8 .cse9 v_prenex_38))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) (+ v_prenex_37 4) v_prenex_40)))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse6 .cse3 v_prenex_34))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store .cse0 .cse2 v_prenex_36) .cse3 v_prenex_35) .cse4 v_prenex_33) (select (select (store .cse5 .cse4 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_prenex_54 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2850 (Array Int Int)) (v_prenex_55 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_55))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2852 Int) (v_ArrVal_2860 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (select (select (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (store .cse15 .cse16 v_ArrVal_2851))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2856)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2858)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2860)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_54) .cse16 v_ArrVal_2850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|))))) (forall ((v_prenex_54 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2850 (Array Int Int)) (v_prenex_55 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_55))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_54) .cse25 v_ArrVal_2850))) (or (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2852 Int) (v_ArrVal_2861 (Array Int Int))) (< (select (select (let ((.cse23 (store .cse24 .cse25 v_ArrVal_2851))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse23 .cse18 (store (select .cse23 .cse18) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_2856))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store .cse17 .cse18 v_ArrVal_2854) .cse19 v_ArrVal_2855) .cse20 v_ArrVal_2857) (select (select (store .cse21 .cse20 v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 1))) (< (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|)))))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_prenex_54 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_23| Int) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2852 Int) (v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (v_prenex_55 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_55))) (let ((.cse26 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= .cse26 (select (select (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store .cse32 .cse26 v_ArrVal_2851))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse30 .cse31 (store (select .cse30 .cse31) (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_23| 4) v_ArrVal_2852)))))) (store .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2856)))) (store .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2858)))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2860)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_54) .cse26 v_ArrVal_2850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_23|))))))) is different from false [2025-03-09 00:39:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183444140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:11,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:39:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2025-03-09 00:39:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455466396] [2025-03-09 00:39:11,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:39:11,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 00:39:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:11,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 00:39:11,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1634, Unknown=59, NotChecked=440, Total=2352 [2025-03-09 00:39:11,499 INFO L87 Difference]: Start difference. First operand 683 states and 774 transitions. Second operand has 35 states, 32 states have (on average 6.3125) internal successors, (202), 34 states have internal predecessors, (202), 2 states have call successors, (2), 1 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:39:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:14,783 INFO L93 Difference]: Finished difference Result 694 states and 788 transitions. [2025-03-09 00:39:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 00:39:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 6.3125) internal successors, (202), 34 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-03-09 00:39:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:14,785 INFO L225 Difference]: With dead ends: 694 [2025-03-09 00:39:14,785 INFO L226 Difference]: Without dead ends: 694 [2025-03-09 00:39:14,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=420, Invalid=2846, Unknown=60, NotChecked=580, Total=3906 [2025-03-09 00:39:14,786 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 931 mSDsluCounter, 3994 mSDsCounter, 0 mSdLazyCounter, 5147 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:14,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4310 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 5147 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-09 00:39:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-09 00:39:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 660. [2025-03-09 00:39:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 477 states have (on average 1.559748427672956) internal successors, (744), 654 states have internal predecessors, (744), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:39:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 750 transitions. [2025-03-09 00:39:14,791 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 750 transitions. Word has length 104 [2025-03-09 00:39:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:14,791 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 750 transitions. [2025-03-09 00:39:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 6.3125) internal successors, (202), 34 states have internal predecessors, (202), 2 states have call successors, (2), 1 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:39:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 750 transitions. [2025-03-09 00:39:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 00:39:14,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:14,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:14,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 00:39:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-09 00:39:14,992 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:14,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1341585237, now seen corresponding path program 1 times [2025-03-09 00:39:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121023643] [2025-03-09 00:39:14,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:15,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 00:39:15,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 00:39:15,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:15,509 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:39:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121023643] [2025-03-09 00:39:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121023643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-09 00:39:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351511452] [2025-03-09 00:39:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:39:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:15,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:39:15,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:39:15,511 INFO L87 Difference]: Start difference. First operand 660 states and 750 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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:39:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:17,097 INFO L93 Difference]: Finished difference Result 711 states and 806 transitions. [2025-03-09 00:39:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:39:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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 106 [2025-03-09 00:39:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:17,099 INFO L225 Difference]: With dead ends: 711 [2025-03-09 00:39:17,099 INFO L226 Difference]: Without dead ends: 711 [2025-03-09 00:39:17,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:39:17,100 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 591 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:17,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2756 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:39:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-09 00:39:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 685. [2025-03-09 00:39:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 501 states have (on average 1.5369261477045908) internal successors, (770), 678 states have internal predecessors, (770), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 777 transitions. [2025-03-09 00:39:17,106 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 777 transitions. Word has length 106 [2025-03-09 00:39:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 777 transitions. [2025-03-09 00:39:17,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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:39:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 777 transitions. [2025-03-09 00:39:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 00:39:17,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:17,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:17,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 00:39:17,107 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1341585236, now seen corresponding path program 1 times [2025-03-09 00:39:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310759175] [2025-03-09 00:39:17,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:17,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 00:39:17,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 00:39:17,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:17,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:17,925 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:39:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310759175] [2025-03-09 00:39:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310759175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-09 00:39:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140277218] [2025-03-09 00:39:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 00:39:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:17,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 00:39:17,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:39:17,926 INFO L87 Difference]: Start difference. First operand 685 states and 777 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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:39:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:20,014 INFO L93 Difference]: Finished difference Result 710 states and 805 transitions. [2025-03-09 00:39:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:39:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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 106 [2025-03-09 00:39:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:20,016 INFO L225 Difference]: With dead ends: 710 [2025-03-09 00:39:20,016 INFO L226 Difference]: Without dead ends: 710 [2025-03-09 00:39:20,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-03-09 00:39:20,016 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 607 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:20,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 3235 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 00:39:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-09 00:39:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 685. [2025-03-09 00:39:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 501 states have (on average 1.5349301397205588) internal successors, (769), 678 states have internal predecessors, (769), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 776 transitions. [2025-03-09 00:39:20,026 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 776 transitions. Word has length 106 [2025-03-09 00:39:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:20,026 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 776 transitions. [2025-03-09 00:39:20,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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:39:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 776 transitions. [2025-03-09 00:39:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:39:20,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:20,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:20,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 00:39:20,027 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -597605599, now seen corresponding path program 1 times [2025-03-09 00:39:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600575660] [2025-03-09 00:39:20,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:39:20,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:39:20,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:20,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:39:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600575660] [2025-03-09 00:39:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600575660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-09 00:39:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692647334] [2025-03-09 00:39:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:39:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:39:21,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:39:21,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:39:21,486 INFO L87 Difference]: Start difference. First operand 685 states and 776 transitions. Second operand has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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:39:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:23,618 INFO L93 Difference]: Finished difference Result 684 states and 775 transitions. [2025-03-09 00:39:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:39:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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 107 [2025-03-09 00:39:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:23,620 INFO L225 Difference]: With dead ends: 684 [2025-03-09 00:39:23,620 INFO L226 Difference]: Without dead ends: 684 [2025-03-09 00:39:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:39:23,621 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1483 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:23,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 3005 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-09 00:39:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-09 00:39:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-09 00:39:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 501 states have (on average 1.532934131736527) internal successors, (768), 677 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 00:39:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 775 transitions. [2025-03-09 00:39:23,625 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 775 transitions. Word has length 107 [2025-03-09 00:39:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:23,626 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 775 transitions. [2025-03-09 00:39:23,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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:39:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 775 transitions. [2025-03-09 00:39:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:39:23,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:23,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:23,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-09 00:39:23,626 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-09 00:39:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -597605598, now seen corresponding path program 1 times [2025-03-09 00:39:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:39:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030148504] [2025-03-09 00:39:23,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:39:23,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:39:23,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:39:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:24,458 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:39:24,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:39:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030148504] [2025-03-09 00:39:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030148504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:39:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330668505] [2025-03-09 00:39:24,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:24,460 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:24,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:39:24,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:39:24,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:39:24,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:24,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:24,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-09 00:39:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:24,672 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:39:24,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:39:24,765 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:39:24,786 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:39:24,791 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:39:24,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:24,868 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:39:24,875 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:39:24,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:24,918 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:39:24,921 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:39:24,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:24,963 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:39:24,965 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:39:25,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:25,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-03-09 00:39:25,012 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:39:25,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:25,056 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:39:25,058 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:39:25,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:25,115 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:39:25,126 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:39:25,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:39:25,216 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:39:25,223 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:39:25,243 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:39:25,246 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:39:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:39:25,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:39:25,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3353) |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~mem59#1.base| v_ArrVal_3354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3353 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2025-03-09 00:39:25,325 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_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3354) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3353 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:39:25,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:39:25,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2025-03-09 00:39:25,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_95))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem57#1.base|)) (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3352) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_96) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_97) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem57#1.offset| 1))))) is different from false [2025-03-09 00:39:25,420 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_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3352) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_96) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_97) |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) 1))) (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_95))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2025-03-09 00:39:25,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3349))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_95))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3349))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3350) .cse4 v_ArrVal_3352) (select (select (store .cse5 .cse4 v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3353))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3350))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3349))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse6 .cse7 v_prenex_96) (select (select (store .cse8 .cse7 v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_97))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))) is different from false [2025-03-09 00:39:25,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3349))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_95))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3349))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3350) .cse5 v_ArrVal_3352) (select (select (store .cse6 .cse5 v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3353))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3350))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3349))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse7 .cse8 v_prenex_96) (select (select (store .cse9 .cse8 v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_97))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))))) is different from false [2025-03-09 00:39:25,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3347 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3348))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3349))) (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~mem55#1.base| v_ArrVal_3347) .cse0 v_ArrVal_3350) .cse1 v_ArrVal_3352) (select (select (store .cse2 .cse1 v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3353))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3347 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3348))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3347) .cse9 v_ArrVal_3350))) (< (select (select (let ((.cse7 (store .cse8 .cse9 v_ArrVal_3349))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse5 .cse6 v_prenex_96) (select (select (store .cse7 .cse6 v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_97))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))) (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3348))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3349)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_prenex_95))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse12)))))) is different from false [2025-03-09 00:39:25,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3354 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3348))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3349)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_95))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3347 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3348))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3349))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3347) .cse6 v_ArrVal_3350) .cse7 v_ArrVal_3352) (select (select (store .cse8 .cse7 v_ArrVal_3351) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3353))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_ArrVal_3347 (Array Int Int)) (v_ArrVal_3348 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3348))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3347) .cse14 v_ArrVal_3350))) (< (select (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_3349))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse10 .cse11 v_prenex_96) (select (select (store .cse12 .cse11 v_prenex_95) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_97))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))))))) is different from false