./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:12:49,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:12:49,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:12:49,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:12:49,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:12:49,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:12:49,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:12:49,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:12:49,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:12:49,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:12:49,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:12:49,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:12:49,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:12:49,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:12:49,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:12:49,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:12:49,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:49,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:49,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:12:49,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:12:49,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:12:49,368 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-jdk21/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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2025-01-10 00:12:49,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:12:49,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:12:49,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:12:49,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:12:49,698 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:12:49,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-01-10 00:12:51,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20aac8fca/a446eaef558d475886d0a68c03bdbb47/FLAGfb4e90c23 [2025-01-10 00:12:52,141 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:12:52,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-01-10 00:12:52,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20aac8fca/a446eaef558d475886d0a68c03bdbb47/FLAGfb4e90c23 [2025-01-10 00:12:52,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20aac8fca/a446eaef558d475886d0a68c03bdbb47 [2025-01-10 00:12:52,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:12:52,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:12:52,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:12:52,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:12:52,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:12:52,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:52,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1ecab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52, skipping insertion in model container [2025-01-10 00:12:52,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:52,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:12:52,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,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-01-10 00:12:52,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,627 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,664 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,666 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,676 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:12:52,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:12:52,731 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:12:52,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:12:52,886 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:12:52,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52 WrapperNode [2025-01-10 00:12:52,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:12:52,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:12:52,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:12:52,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:12:52,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:52,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:52,995 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-01-10 00:12:52,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:12:52,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:12:52,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:12:52,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:12:53,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,103 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-01-10 00:12:53,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:12:53,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:12:53,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:12:53,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:12:53,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2025-01-10 00:12:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:12:53,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:12:53,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:12:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:12:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:12:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:12:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:12:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:12:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:12:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:12:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:12:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:12:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:12:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:12:53,466 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:12:53,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:12:53,487 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:53,510 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:53,527 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:56,464 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-01-10 00:12:56,464 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:12:56,503 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:12:56,503 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-10 00:12:56,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:56 BoogieIcfgContainer [2025-01-10 00:12:56,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:12:56,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:12:56,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:12:56,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:12:56,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:12:52" (1/3) ... [2025-01-10 00:12:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517c213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:56, skipping insertion in model container [2025-01-10 00:12:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (2/3) ... [2025-01-10 00:12:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517c213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:56, skipping insertion in model container [2025-01-10 00:12:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:56" (3/3) ... [2025-01-10 00:12:56,513 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2025-01-10 00:12:56,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:12:56,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-1.i that has 6 procedures, 1741 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-01-10 00:12:56,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:12:56,605 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;@57f25087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:12:56,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-01-10 00:12:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:12:56,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:56,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:12:56,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr710ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:12:56,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 65531891, now seen corresponding path program 1 times [2025-01-10 00:12:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202414260] [2025-01-10 00:12:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:56,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:12:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:12:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202414260] [2025-01-10 00:12:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202414260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455710276] [2025-01-10 00:12:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:56,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:56,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:56,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:56,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:56,827 INFO L87 Difference]: Start difference. First operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 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-01-10 00:12:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:56,987 INFO L93 Difference]: Finished difference Result 3403 states and 3923 transitions. [2025-01-10 00:12:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:56,990 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-01-10 00:12:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:57,013 INFO L225 Difference]: With dead ends: 3403 [2025-01-10 00:12:57,014 INFO L226 Difference]: Without dead ends: 3401 [2025-01-10 00:12:57,015 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-01-10 00:12:57,017 INFO L435 NwaCegarLoop]: 1969 mSDtfsCounter, 1927 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:57,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 3929 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:12:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-01-10 00:12:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 1711. [2025-01-10 00:12:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1000 states have (on average 1.947) internal successors, (1947), 1701 states have internal predecessors, (1947), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:12:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 1971 transitions. [2025-01-10 00:12:57,124 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 1971 transitions. Word has length 5 [2025-01-10 00:12:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:57,124 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 1971 transitions. [2025-01-10 00:12:57,125 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-01-10 00:12:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 1971 transitions. [2025-01-10 00:12:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:12:57,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:57,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:12:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:12:57,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:12:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 63049834, now seen corresponding path program 1 times [2025-01-10 00:12:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836037570] [2025-01-10 00:12:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:57,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:12:57,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:12:57,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:57,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:57,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836037570] [2025-01-10 00:12:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836037570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:57,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966504314] [2025-01-10 00:12:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:57,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:57,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:57,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:57,244 INFO L87 Difference]: Start difference. First operand 1711 states and 1971 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-01-10 00:12:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:58,048 INFO L93 Difference]: Finished difference Result 1619 states and 1879 transitions. [2025-01-10 00:12:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:58,049 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-01-10 00:12:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:58,053 INFO L225 Difference]: With dead ends: 1619 [2025-01-10 00:12:58,053 INFO L226 Difference]: Without dead ends: 1619 [2025-01-10 00:12:58,054 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-01-10 00:12:58,054 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 1730 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:58,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1188 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:12:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-10 00:12:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2025-01-10 00:12:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1000 states have (on average 1.855) internal successors, (1855), 1609 states have internal predecessors, (1855), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:12:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1879 transitions. [2025-01-10 00:12:58,078 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1879 transitions. Word has length 5 [2025-01-10 00:12:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:58,078 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 1879 transitions. [2025-01-10 00:12:58,078 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-01-10 00:12:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1879 transitions. [2025-01-10 00:12:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:12:58,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:58,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:12:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:12:58,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:12:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash 63049835, now seen corresponding path program 1 times [2025-01-10 00:12:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312040440] [2025-01-10 00:12:58,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:12:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:12:58,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312040440] [2025-01-10 00:12:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312040440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:58,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:58,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812926076] [2025-01-10 00:12:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:58,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:58,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:58,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:58,212 INFO L87 Difference]: Start difference. First operand 1619 states and 1879 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-01-10 00:12:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:59,145 INFO L93 Difference]: Finished difference Result 2353 states and 2777 transitions. [2025-01-10 00:12:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:59,146 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-01-10 00:12:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:59,152 INFO L225 Difference]: With dead ends: 2353 [2025-01-10 00:12:59,152 INFO L226 Difference]: Without dead ends: 2353 [2025-01-10 00:12:59,152 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-01-10 00:12:59,153 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1212 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:59,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2463 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:12:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-01-10 00:12:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1881. [2025-01-10 00:12:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1272 states have (on average 1.830188679245283) internal successors, (2328), 1871 states have internal predecessors, (2328), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:12:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2352 transitions. [2025-01-10 00:12:59,181 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2352 transitions. Word has length 5 [2025-01-10 00:12:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2352 transitions. [2025-01-10 00:12:59,181 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-01-10 00:12:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2352 transitions. [2025-01-10 00:12:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:12:59,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:59,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:59,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:12:59,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:12:59,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 477027540, now seen corresponding path program 1 times [2025-01-10 00:12:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:59,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892213930] [2025-01-10 00:12:59,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:12:59,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:12:59,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:59,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892213930] [2025-01-10 00:12:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892213930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974975474] [2025-01-10 00:12:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:59,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:59,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:59,237 INFO L87 Difference]: Start difference. First operand 1881 states and 2352 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:00,460 INFO L93 Difference]: Finished difference Result 1907 states and 2405 transitions. [2025-01-10 00:13:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:13:00,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:13:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:00,469 INFO L225 Difference]: With dead ends: 1907 [2025-01-10 00:13:00,472 INFO L226 Difference]: Without dead ends: 1907 [2025-01-10 00:13:00,473 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-01-10 00:13:00,473 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 1997 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:00,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2163 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:13:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2025-01-10 00:13:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1858. [2025-01-10 00:13:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1272 states have (on average 1.8121069182389937) internal successors, (2305), 1848 states have internal predecessors, (2305), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2329 transitions. [2025-01-10 00:13:00,529 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2329 transitions. Word has length 11 [2025-01-10 00:13:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:00,529 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2329 transitions. [2025-01-10 00:13:00,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2329 transitions. [2025-01-10 00:13:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:13:00,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:00,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:13:00,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 477027541, now seen corresponding path program 1 times [2025-01-10 00:13:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510117904] [2025-01-10 00:13:00,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:00,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:13:00,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:13:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:00,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510117904] [2025-01-10 00:13:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510117904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:00,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:13:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025294756] [2025-01-10 00:13:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:13:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:13:00,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:13:00,622 INFO L87 Difference]: Start difference. First operand 1858 states and 2329 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:00,647 INFO L93 Difference]: Finished difference Result 1783 states and 2226 transitions. [2025-01-10 00:13:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:13:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:13:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:00,652 INFO L225 Difference]: With dead ends: 1783 [2025-01-10 00:13:00,652 INFO L226 Difference]: Without dead ends: 1783 [2025-01-10 00:13:00,652 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-01-10 00:13:00,653 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 60 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:00,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:13:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-01-10 00:13:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2025-01-10 00:13:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1209 states have (on average 1.8213399503722085) internal successors, (2202), 1773 states have internal predecessors, (2202), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2226 transitions. [2025-01-10 00:13:00,674 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2226 transitions. Word has length 11 [2025-01-10 00:13:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2226 transitions. [2025-01-10 00:13:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2226 transitions. [2025-01-10 00:13:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:13:00,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:00,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:13:00,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1903167439, now seen corresponding path program 1 times [2025-01-10 00:13:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589290079] [2025-01-10 00:13:00,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:13:00,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:13:00,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:00,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:00,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589290079] [2025-01-10 00:13:00,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589290079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:13:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489250313] [2025-01-10 00:13:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:00,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:13:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:00,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:13:00,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:13:00,719 INFO L87 Difference]: Start difference. First operand 1783 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:00,766 INFO L93 Difference]: Finished difference Result 1765 states and 2201 transitions. [2025-01-10 00:13:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:13:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 00:13:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:00,770 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:13:00,770 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:13:00,770 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-01-10 00:13:00,771 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 41 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:00,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5057 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:13:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:13:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1762. [2025-01-10 00:13:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1195 states have (on average 1.8192468619246862) internal successors, (2174), 1752 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2198 transitions. [2025-01-10 00:13:00,791 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2198 transitions. Word has length 12 [2025-01-10 00:13:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:00,791 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2198 transitions. [2025-01-10 00:13:00,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2198 transitions. [2025-01-10 00:13:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 00:13:00,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:00,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] [2025-01-10 00:13:00,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:13:00,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:00,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1855964541, now seen corresponding path program 1 times [2025-01-10 00:13:00,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:00,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013818260] [2025-01-10 00:13:00,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:00,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:13:00,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:13:00,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013818260] [2025-01-10 00:13:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013818260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:13:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688423688] [2025-01-10 00:13:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:13:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:00,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:13:00,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:13:00,923 INFO L87 Difference]: Start difference. First operand 1762 states and 2198 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:01,975 INFO L93 Difference]: Finished difference Result 2279 states and 2695 transitions. [2025-01-10 00:13:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:13:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 00:13:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:01,981 INFO L225 Difference]: With dead ends: 2279 [2025-01-10 00:13:01,981 INFO L226 Difference]: Without dead ends: 2279 [2025-01-10 00:13:01,981 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-01-10 00:13:01,982 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 1217 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:01,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3366 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:13:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-01-10 00:13:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1758. [2025-01-10 00:13:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.8158995815899581) internal successors, (2170), 1748 states have internal predecessors, (2170), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2194 transitions. [2025-01-10 00:13:02,023 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2194 transitions. Word has length 26 [2025-01-10 00:13:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2194 transitions. [2025-01-10 00:13:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2194 transitions. [2025-01-10 00:13:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 00:13:02,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:02,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:02,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:13:02,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:02,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -754980717, now seen corresponding path program 1 times [2025-01-10 00:13:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:02,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795391824] [2025-01-10 00:13:02,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:02,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 00:13:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 00:13:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795391824] [2025-01-10 00:13:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795391824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:02,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:13:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524278483] [2025-01-10 00:13:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:02,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:13:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:02,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:13:02,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:13:02,120 INFO L87 Difference]: Start difference. First operand 1758 states and 2194 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:02,160 INFO L93 Difference]: Finished difference Result 1758 states and 2190 transitions. [2025-01-10 00:13:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:13:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-10 00:13:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:02,165 INFO L225 Difference]: With dead ends: 1758 [2025-01-10 00:13:02,165 INFO L226 Difference]: Without dead ends: 1758 [2025-01-10 00:13:02,165 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-01-10 00:13:02,165 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 21 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:02,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5039 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:13:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-01-10 00:13:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1758. [2025-01-10 00:13:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.81255230125523) internal successors, (2166), 1748 states have internal predecessors, (2166), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2190 transitions. [2025-01-10 00:13:02,183 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2190 transitions. Word has length 60 [2025-01-10 00:13:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:02,183 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2190 transitions. [2025-01-10 00:13:02,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2190 transitions. [2025-01-10 00:13:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:13:02,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:02,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:02,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:13:02,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash -428091937, now seen corresponding path program 1 times [2025-01-10 00:13:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189922476] [2025-01-10 00:13:02,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:02,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:13:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:13:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:02,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189922476] [2025-01-10 00:13:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189922476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:02,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:02,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:13:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97560005] [2025-01-10 00:13:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:02,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:13:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:02,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:13:02,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:13:02,291 INFO L87 Difference]: Start difference. First operand 1758 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:02,331 INFO L93 Difference]: Finished difference Result 1849 states and 2308 transitions. [2025-01-10 00:13:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:13:02,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-10 00:13:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:02,336 INFO L225 Difference]: With dead ends: 1849 [2025-01-10 00:13:02,337 INFO L226 Difference]: Without dead ends: 1849 [2025-01-10 00:13:02,337 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-01-10 00:13:02,337 INFO L435 NwaCegarLoop]: 1704 mSDtfsCounter, 54 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:02,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3381 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:13:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-01-10 00:13:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1849. [2025-01-10 00:13:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1286 states have (on average 1.776049766718507) internal successors, (2284), 1839 states have internal predecessors, (2284), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2308 transitions. [2025-01-10 00:13:02,361 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2308 transitions. Word has length 68 [2025-01-10 00:13:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:02,361 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2308 transitions. [2025-01-10 00:13:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2308 transitions. [2025-01-10 00:13:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 00:13:02,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:02,362 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-01-10 00:13:02,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:13:02,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:02,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1638039152, now seen corresponding path program 1 times [2025-01-10 00:13:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358070408] [2025-01-10 00:13:02,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:02,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 00:13:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 00:13:02,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:02,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358070408] [2025-01-10 00:13:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358070408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:02,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:13:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833482731] [2025-01-10 00:13:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:02,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:13:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:02,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:13:02,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:13:02,824 INFO L87 Difference]: Start difference. First operand 1849 states and 2308 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:04,215 INFO L93 Difference]: Finished difference Result 1765 states and 2224 transitions. [2025-01-10 00:13:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:13:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-10 00:13:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:04,220 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:13:04,220 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:13:04,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:13:04,220 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 3033 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:04,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 2350 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:13:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:13:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1493. [2025-01-10 00:13:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1014 states have (on average 1.693293885601578) internal successors, (1717), 1483 states have internal predecessors, (1717), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1741 transitions. [2025-01-10 00:13:04,237 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1741 transitions. Word has length 71 [2025-01-10 00:13:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:04,237 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1741 transitions. [2025-01-10 00:13:04,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1741 transitions. [2025-01-10 00:13:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:13:04,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:04,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:13:04,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash 184750066, now seen corresponding path program 1 times [2025-01-10 00:13:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030076085] [2025-01-10 00:13:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:04,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:13:04,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:13:04,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:04,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030076085] [2025-01-10 00:13:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030076085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:04,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:13:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005029604] [2025-01-10 00:13:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:13:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:04,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:13:04,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:13:04,443 INFO L87 Difference]: Start difference. First operand 1493 states and 1741 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:05,320 INFO L93 Difference]: Finished difference Result 1492 states and 1740 transitions. [2025-01-10 00:13:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:13:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:13:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:05,324 INFO L225 Difference]: With dead ends: 1492 [2025-01-10 00:13:05,325 INFO L226 Difference]: Without dead ends: 1492 [2025-01-10 00:13:05,325 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-01-10 00:13:05,326 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 2 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:05,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4750 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:13:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-10 00:13:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-01-10 00:13:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1014 states have (on average 1.6923076923076923) internal successors, (1716), 1482 states have internal predecessors, (1716), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:13:05,340 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 76 [2025-01-10 00:13:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:05,341 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:13:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:13:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:13:05,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:05,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:13:05,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 184750067, now seen corresponding path program 1 times [2025-01-10 00:13:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474821392] [2025-01-10 00:13:05,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:13:05,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:13:05,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:05,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474821392] [2025-01-10 00:13:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474821392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:05,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:13:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224803878] [2025-01-10 00:13:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:13:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:13:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:13:05,688 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:06,642 INFO L93 Difference]: Finished difference Result 1491 states and 1739 transitions. [2025-01-10 00:13:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:13:06,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:13:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:06,646 INFO L225 Difference]: With dead ends: 1491 [2025-01-10 00:13:06,646 INFO L226 Difference]: Without dead ends: 1491 [2025-01-10 00:13:06,646 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-01-10 00:13:06,647 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:06,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4772 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:13:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-01-10 00:13:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-01-10 00:13:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1013 states have (on average 1.6929911154985193) internal successors, (1715), 1481 states have internal predecessors, (1715), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1739 transitions. [2025-01-10 00:13:06,661 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1739 transitions. Word has length 76 [2025-01-10 00:13:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:06,661 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1739 transitions. [2025-01-10 00:13:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:13:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1739 transitions. [2025-01-10 00:13:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:13:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:06,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:13:06,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 688711257, now seen corresponding path program 1 times [2025-01-10 00:13:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377694429] [2025-01-10 00:13:06,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:13:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:13:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377694429] [2025-01-10 00:13:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377694429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:13:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647894144] [2025-01-10 00:13:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:13:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:06,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:13:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:13:06,972 INFO L87 Difference]: Start difference. First operand 1491 states and 1739 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:08,318 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:13:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:13:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-01-10 00:13:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:08,322 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:13:08,322 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:13:08,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:13:08,327 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 13 mSDsluCounter, 5830 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:08,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7428 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:13:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:13:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1497. [2025-01-10 00:13:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6915520628683693) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:13:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1752 transitions. [2025-01-10 00:13:08,344 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1752 transitions. Word has length 84 [2025-01-10 00:13:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1752 transitions. [2025-01-10 00:13:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1752 transitions. [2025-01-10 00:13:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:13:08,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:08,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:13:08,345 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 688711258, now seen corresponding path program 1 times [2025-01-10 00:13:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064099324] [2025-01-10 00:13:08,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:08,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:13:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:13:08,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:08,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064099324] [2025-01-10 00:13:08,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064099324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:08,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:08,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:13:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741235887] [2025-01-10 00:13:08,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:08,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:13:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:08,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:13:08,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:13:08,701 INFO L87 Difference]: Start difference. First operand 1497 states and 1752 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:09,780 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-01-10 00:13:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:13:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-01-10 00:13:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:09,786 INFO L225 Difference]: With dead ends: 1497 [2025-01-10 00:13:09,786 INFO L226 Difference]: Without dead ends: 1497 [2025-01-10 00:13:09,789 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-01-10 00:13:09,789 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 8 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:09,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6099 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:13:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-01-10 00:13:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2025-01-10 00:13:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6905697445972494) internal successors, (1721), 1486 states have internal predecessors, (1721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:13:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1751 transitions. [2025-01-10 00:13:09,810 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1751 transitions. Word has length 84 [2025-01-10 00:13:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:09,810 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1751 transitions. [2025-01-10 00:13:09,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1751 transitions. [2025-01-10 00:13:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:13:09,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:09,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:09,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:13:09,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:09,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash -595546505, now seen corresponding path program 1 times [2025-01-10 00:13:09,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:09,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704321434] [2025-01-10 00:13:09,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:09,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:13:09,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:13:09,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:09,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704321434] [2025-01-10 00:13:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704321434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450659060] [2025-01-10 00:13:10,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:10,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:10,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:13:10,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:13:10,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:13:10,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:10,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:10,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:13:10,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:10,477 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:10,510 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-01-10 00:13:10,574 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-01-10 00:13:10,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:10,708 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-01-10 00:13:10,745 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-01-10 00:13:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:10,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:10,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:13:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450659060] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-01-10 00:13:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118085808] [2025-01-10 00:13:10,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:13:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:10,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:13:10,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-01-10 00:13:10,805 INFO L87 Difference]: Start difference. First operand 1497 states and 1751 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 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-01-10 00:13:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:14,180 INFO L93 Difference]: Finished difference Result 1504 states and 1758 transitions. [2025-01-10 00:13:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-01-10 00:13:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:14,187 INFO L225 Difference]: With dead ends: 1504 [2025-01-10 00:13:14,188 INFO L226 Difference]: Without dead ends: 1504 [2025-01-10 00:13:14,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-01-10 00:13:14,190 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1549 mSDsluCounter, 11117 mSDsCounter, 0 mSdLazyCounter, 7172 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 12154 SdHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:14,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 12154 Invalid, 7200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 7172 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-10 00:13:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-10 00:13:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1501. [2025-01-10 00:13:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1489 states have internal predecessors, (1725), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1750 transitions. [2025-01-10 00:13:14,228 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1750 transitions. Word has length 85 [2025-01-10 00:13:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:14,229 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1750 transitions. [2025-01-10 00:13:14,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 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-01-10 00:13:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1750 transitions. [2025-01-10 00:13:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:13:14,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:14,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:14,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:13:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:13:14,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:14,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -595546504, now seen corresponding path program 1 times [2025-01-10 00:13:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639537386] [2025-01-10 00:13:14,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:14,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:13:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:13:14,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639537386] [2025-01-10 00:13:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639537386] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388247584] [2025-01-10 00:13:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:15,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:15,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:15,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:15,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:13:15,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:13:15,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:13:15,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:15,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:15,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 00:13:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:15,549 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-01-10 00:13:15,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:15,561 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-01-10 00:13:15,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:13:15,592 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-01-10 00:13:15,672 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-01-10 00:13:15,676 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-01-10 00:13:15,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:15,773 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-01-10 00:13:15,781 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-01-10 00:13:15,818 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-01-10 00:13:15,825 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-01-10 00:13:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:15,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:15,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_664 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-01-10 00:13:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388247584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:15,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:15,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-01-10 00:13:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933087339] [2025-01-10 00:13:15,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:15,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:13:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:15,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:13:15,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-01-10 00:13:15,942 INFO L87 Difference]: Start difference. First operand 1501 states and 1750 transitions. Second operand has 18 states, 15 states have (on average 7.333333333333333) internal successors, (110), 18 states have internal predecessors, (110), 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-01-10 00:13:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:19,588 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:13:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:13:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.333333333333333) internal successors, (110), 18 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-01-10 00:13:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:19,595 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:13:19,595 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:13:19,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-01-10 00:13:19,596 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1558 mSDsluCounter, 6004 mSDsCounter, 0 mSdLazyCounter, 5920 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 7047 SdHoareTripleChecker+Invalid, 5964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:19,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 7047 Invalid, 5964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5920 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-10 00:13:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:13:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1494. [2025-01-10 00:13:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1017 states have (on average 1.6892822025565388) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2025-01-10 00:13:19,624 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 85 [2025-01-10 00:13:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:19,624 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2025-01-10 00:13:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.333333333333333) internal successors, (110), 18 states have internal predecessors, (110), 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-01-10 00:13:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2025-01-10 00:13:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:13:19,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:19,624 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-01-10 00:13:19,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:13:19,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:13:19,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 338900983, now seen corresponding path program 1 times [2025-01-10 00:13:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888214245] [2025-01-10 00:13:19,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:19,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:13:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:13:19,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:19,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:20,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888214245] [2025-01-10 00:13:20,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888214245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:20,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:20,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:13:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835391912] [2025-01-10 00:13:20,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:20,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:13:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:20,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:13:20,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:13:20,517 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:23,418 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:13:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:13:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-01-10 00:13:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:23,422 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:13:23,422 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:13:23,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:13:23,423 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1538 mSDsluCounter, 8127 mSDsCounter, 0 mSdLazyCounter, 5398 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 9164 SdHoareTripleChecker+Invalid, 5423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:23,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 9164 Invalid, 5423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5398 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:13:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:13:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1503. [2025-01-10 00:13:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6858536585365853) internal successors, (1728), 1491 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1753 transitions. [2025-01-10 00:13:23,443 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1753 transitions. Word has length 87 [2025-01-10 00:13:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:23,443 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1753 transitions. [2025-01-10 00:13:23,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1753 transitions. [2025-01-10 00:13:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:13:23,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:23,444 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-01-10 00:13:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:13:23,445 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 338900984, now seen corresponding path program 1 times [2025-01-10 00:13:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801571144] [2025-01-10 00:13:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:23,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:13:23,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:13:23,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:23,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801571144] [2025-01-10 00:13:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801571144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:13:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904626919] [2025-01-10 00:13:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:24,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:13:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:24,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:13:24,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:13:24,082 INFO L87 Difference]: Start difference. First operand 1503 states and 1753 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:26,707 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:13:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:13:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-01-10 00:13:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:26,712 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:13:26,712 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:13:26,712 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-01-10 00:13:26,713 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1553 mSDsluCounter, 6191 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 7235 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:26,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 7235 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-10 00:13:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:13:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:13:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6848780487804877) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:13:26,733 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 87 [2025-01-10 00:13:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:26,733 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:13:26,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:13:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:13:26,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:26,734 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-01-10 00:13:26,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:13:26,735 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:26,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash 584586009, now seen corresponding path program 1 times [2025-01-10 00:13:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:26,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530515425] [2025-01-10 00:13:26,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:26,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:13:26,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:13:26,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:26,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530515425] [2025-01-10 00:13:27,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530515425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747786243] [2025-01-10 00:13:27,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:27,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:27,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:13:27,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:13:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:13:27,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:27,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:13:27,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:27,449 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-01-10 00:13:27,569 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:27,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:27,602 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-01-10 00:13:27,694 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-01-10 00:13:27,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:27,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:13:27,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:27,940 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-01-10 00:13:27,967 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-01-10 00:13:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:28,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:28,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_925))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747786243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:28,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-01-10 00:13:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699054375] [2025-01-10 00:13:28,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:28,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:13:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:28,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:13:28,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=463, Unknown=11, NotChecked=44, Total=600 [2025-01-10 00:13:28,083 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 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-01-10 00:13:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:31,839 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:13:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 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 88 [2025-01-10 00:13:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:31,842 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:13:31,844 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:13:31,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=591, Unknown=11, NotChecked=50, Total=756 [2025-01-10 00:13:31,845 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1522 mSDsluCounter, 10137 mSDsCounter, 0 mSdLazyCounter, 6576 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 11173 SdHoareTripleChecker+Invalid, 6604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:31,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 11173 Invalid, 6604 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 6576 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-10 00:13:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:13:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1502. [2025-01-10 00:13:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1490 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1751 transitions. [2025-01-10 00:13:31,878 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1751 transitions. Word has length 88 [2025-01-10 00:13:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:31,878 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1751 transitions. [2025-01-10 00:13:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 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-01-10 00:13:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1751 transitions. [2025-01-10 00:13:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:13:31,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:31,879 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-01-10 00:13:31,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:13:32,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:32,080 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash 584586010, now seen corresponding path program 1 times [2025-01-10 00:13:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662482161] [2025-01-10 00:13:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:13:32,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:13:32,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662482161] [2025-01-10 00:13:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662482161] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602889786] [2025-01-10 00:13:32,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:32,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:32,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:32,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:13:32,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:13:33,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:13:33,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:33,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:33,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:13:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:33,034 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-01-10 00:13:33,281 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-01-10 00:13:33,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:33,290 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-01-10 00:13:33,302 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-01-10 00:13:33,306 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-01-10 00:13:33,356 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-01-10 00:13:33,360 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-01-10 00:13:33,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:33,467 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-01-10 00:13:33,478 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-01-10 00:13:33,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:33,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:13:33,545 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-01-10 00:13:33,563 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-01-10 00:13:33,570 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-01-10 00:13:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:33,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:33,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1065 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:13:33,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1065 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-01-10 00:13:33,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1072) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1071))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1072) .cse1 v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:13:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602889786] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:33,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:33,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-01-10 00:13:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001578342] [2025-01-10 00:13:33,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:33,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:13:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:33,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:13:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-01-10 00:13:33,694 INFO L87 Difference]: Start difference. First operand 1502 states and 1751 transitions. Second operand has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-01-10 00:13:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:37,647 INFO L93 Difference]: Finished difference Result 1504 states and 1758 transitions. [2025-01-10 00:13:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:13:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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 88 [2025-01-10 00:13:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:37,652 INFO L225 Difference]: With dead ends: 1504 [2025-01-10 00:13:37,652 INFO L226 Difference]: Without dead ends: 1504 [2025-01-10 00:13:37,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:13:37,655 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1526 mSDsluCounter, 7984 mSDsCounter, 0 mSdLazyCounter, 7047 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 9026 SdHoareTripleChecker+Invalid, 7073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:37,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 9026 Invalid, 7073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7047 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-10 00:13:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-10 00:13:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1492. [2025-01-10 00:13:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1017 states have (on average 1.6873156342182891) internal successors, (1716), 1481 states have internal predecessors, (1716), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:13:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:13:37,675 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 88 [2025-01-10 00:13:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:37,675 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:13:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-01-10 00:13:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:13:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:13:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:37,680 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-01-10 00:13:37,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:13:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:37,884 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:37,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1268304704, now seen corresponding path program 1 times [2025-01-10 00:13:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:37,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703080545] [2025-01-10 00:13:37,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:37,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:13:37,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:13:37,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:37,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:38,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703080545] [2025-01-10 00:13:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703080545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:13:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415709619] [2025-01-10 00:13:38,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:38,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:13:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:38,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:13:38,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:13:38,299 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:41,373 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:13:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-01-10 00:13:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:41,377 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:13:41,377 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:13:41,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:13:41,378 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1562 mSDsluCounter, 9127 mSDsCounter, 0 mSdLazyCounter, 5979 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 10163 SdHoareTripleChecker+Invalid, 6005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:41,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 10163 Invalid, 6005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5979 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:13:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:13:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1504. [2025-01-10 00:13:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6819066147859922) internal successors, (1729), 1492 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1754 transitions. [2025-01-10 00:13:41,392 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1754 transitions. Word has length 90 [2025-01-10 00:13:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:41,392 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1754 transitions. [2025-01-10 00:13:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1754 transitions. [2025-01-10 00:13:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:13:41,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:41,393 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-01-10 00:13:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:13:41,393 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1268304703, now seen corresponding path program 1 times [2025-01-10 00:13:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747067114] [2025-01-10 00:13:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:13:41,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:13:41,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:41,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747067114] [2025-01-10 00:13:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747067114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:13:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204972055] [2025-01-10 00:13:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:42,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:13:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:13:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:13:42,047 INFO L87 Difference]: Start difference. First operand 1504 states and 1754 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:44,590 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:13:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:13:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-01-10 00:13:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:44,593 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:13:44,593 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:13:44,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:13:44,594 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1555 mSDsluCounter, 5207 mSDsCounter, 0 mSdLazyCounter, 5051 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 6250 SdHoareTripleChecker+Invalid, 5075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:44,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 6250 Invalid, 5075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5051 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 00:13:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:13:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1504. [2025-01-10 00:13:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6809338521400778) internal successors, (1728), 1492 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1753 transitions. [2025-01-10 00:13:44,605 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1753 transitions. Word has length 90 [2025-01-10 00:13:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1753 transitions. [2025-01-10 00:13:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1753 transitions. [2025-01-10 00:13:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:13:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:44,606 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-01-10 00:13:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:13:44,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -689967522, now seen corresponding path program 1 times [2025-01-10 00:13:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849879272] [2025-01-10 00:13:44,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:44,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:13:44,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:13:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:45,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849879272] [2025-01-10 00:13:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849879272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597807509] [2025-01-10 00:13:45,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:45,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:13:45,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:13:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:13:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:45,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:13:45,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:45,454 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-01-10 00:13:45,696 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:45,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:45,718 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-01-10 00:13:45,807 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-01-10 00:13:45,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:45,923 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-01-10 00:13:46,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:46,000 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-01-10 00:13:46,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:46,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-01-10 00:13:46,062 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-01-10 00:13:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:46,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:46,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1354 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:13:46,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1353))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:50,335 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1357))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1353)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1354)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597807509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2025-01-10 00:13:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453693726] [2025-01-10 00:13:50,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:13:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:13:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=497, Unknown=15, NotChecked=144, Total=756 [2025-01-10 00:13:50,342 INFO L87 Difference]: Start difference. First operand 1504 states and 1753 transitions. Second operand has 23 states, 20 states have (on average 7.25) internal successors, (145), 23 states have internal predecessors, (145), 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-01-10 00:13:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:55,749 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:13:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 23 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-01-10 00:13:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:55,754 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:13:55,754 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:13:55,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=536, Unknown=15, NotChecked=150, Total=812 [2025-01-10 00:13:55,755 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1517 mSDsluCounter, 12129 mSDsCounter, 0 mSdLazyCounter, 7747 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 13170 SdHoareTripleChecker+Invalid, 7785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:55,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 13170 Invalid, 7785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 7747 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-10 00:13:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:13:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:13:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1028 states have (on average 1.6799610894941635) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:13:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:13:55,772 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 91 [2025-01-10 00:13:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:55,773 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:13:55,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 23 states have internal predecessors, (145), 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-01-10 00:13:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:13:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:13:55,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:55,776 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-01-10 00:13:55,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:13:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:13:55,977 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:13:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -689967521, now seen corresponding path program 1 times [2025-01-10 00:13:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299242375] [2025-01-10 00:13:55,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:55,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:13:56,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:13:56,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:56,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299242375] [2025-01-10 00:13:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299242375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264572446] [2025-01-10 00:13:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:56,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:13:56,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:13:56,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:13:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:13:56,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:56,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:13:56,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:56,867 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-01-10 00:13:57,037 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:57,038 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-01-10 00:13:57,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:13:57,063 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-01-10 00:13:57,070 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-01-10 00:13:57,133 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-01-10 00:13:57,136 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-01-10 00:13:57,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:57,211 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-01-10 00:13:57,216 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-01-10 00:13:57,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:57,276 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-01-10 00:13:57,282 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-01-10 00:13:57,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:57,327 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-01-10 00:13:57,332 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-01-10 00:13:57,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:13:57,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:13:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:57,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:57,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1511 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:13:57,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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1511 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:13:57,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1510))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1509) .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1509) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-01-10 00:13:57,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1509) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1510))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1509) .cse2 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:13:57,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1518))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1510))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1517) .cse0 v_ArrVal_1509) .cse1 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1518))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1517) .cse5 v_ArrVal_1509) (select (select (store .cse6 .cse5 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1511))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-01-10 00:13:57,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264572446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:57,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-01-10 00:13:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932947243] [2025-01-10 00:13:57,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:13:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:57,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:13:57,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2025-01-10 00:13:57,487 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 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-01-10 00:14:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:14:02,703 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:14:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:14:02,704 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-01-10 00:14:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:14:02,710 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:14:02,710 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:14:02,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2025-01-10 00:14:02,715 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1528 mSDsluCounter, 10377 mSDsCounter, 0 mSdLazyCounter, 9497 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 11418 SdHoareTripleChecker+Invalid, 9527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 9497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:14:02,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 11418 Invalid, 9527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 9497 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-10 00:14:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:14:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1490. [2025-01-10 00:14:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1017 states have (on average 1.6853490658800394) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:14:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1738 transitions. [2025-01-10 00:14:02,738 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1738 transitions. Word has length 91 [2025-01-10 00:14:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:14:02,738 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1738 transitions. [2025-01-10 00:14:02,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 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-01-10 00:14:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1738 transitions. [2025-01-10 00:14:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:14:02,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:14:02,740 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-01-10 00:14:02,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:14:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:14:02,945 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:14:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:14:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1237503362, now seen corresponding path program 1 times [2025-01-10 00:14:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:14:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948367381] [2025-01-10 00:14:02,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:14:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:14:02,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:14:02,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:14:02,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:14:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:14:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:14:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:14:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948367381] [2025-01-10 00:14:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948367381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:14:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:14:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:14:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828196328] [2025-01-10 00:14:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:14:03,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:14:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:14:03,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:14:03,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:14:03,420 INFO L87 Difference]: Start difference. First operand 1490 states and 1738 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:14:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:14:06,274 INFO L93 Difference]: Finished difference Result 1509 states and 1763 transitions. [2025-01-10 00:14:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:14:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:14:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:14:06,281 INFO L225 Difference]: With dead ends: 1509 [2025-01-10 00:14:06,281 INFO L226 Difference]: Without dead ends: 1509 [2025-01-10 00:14:06,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-01-10 00:14:06,282 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1563 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 9139 SdHoareTripleChecker+Invalid, 5441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:14:06,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 9139 Invalid, 5441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:14:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-01-10 00:14:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1505. [2025-01-10 00:14:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6779825412221145) internal successors, (1730), 1493 states have internal predecessors, (1730), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:14:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1755 transitions. [2025-01-10 00:14:06,296 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1755 transitions. Word has length 93 [2025-01-10 00:14:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:14:06,297 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1755 transitions. [2025-01-10 00:14:06,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:14:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1755 transitions. [2025-01-10 00:14:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:14:06,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:14:06,298 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-01-10 00:14:06,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:14:06,298 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:14:06,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:14:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1237503361, now seen corresponding path program 1 times [2025-01-10 00:14:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:14:06,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299404503] [2025-01-10 00:14:06,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:14:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:14:06,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:14:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:14:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:14:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:14:07,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-01-10 00:14:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:14:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299404503] [2025-01-10 00:14:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299404503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:14:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:14:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:14:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993641837] [2025-01-10 00:14:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:14:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:14:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:14:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:14:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:14:07,111 INFO L87 Difference]: Start difference. First operand 1505 states and 1755 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:14:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:14:10,162 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:14:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:14:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:14:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:14:10,169 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:14:10,170 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:14:10,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:14:10,170 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1556 mSDsluCounter, 5211 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 6253 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:14:10,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 6253 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:14:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:14:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1505. [2025-01-10 00:14:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6770126091173618) internal successors, (1729), 1493 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:14:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1754 transitions. [2025-01-10 00:14:10,181 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1754 transitions. Word has length 93 [2025-01-10 00:14:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:14:10,181 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1754 transitions. [2025-01-10 00:14:10,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:14:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1754 transitions. [2025-01-10 00:14:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:14:10,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:14:10,182 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-01-10 00:14:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:14:10,182 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:14:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:14:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 891661344, now seen corresponding path program 1 times [2025-01-10 00:14:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:14:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504401507] [2025-01-10 00:14:10,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:14:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:14:10,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:14:10,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:14:10,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:14:10,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:14:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:14:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:14:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504401507] [2025-01-10 00:14:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504401507] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:14:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283813237] [2025-01-10 00:14:10,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:14:10,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:14:10,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:14:10,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:14:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:14:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:14:11,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:14:11,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:14:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:14:11,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 00:14:11,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:14:11,069 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-01-10 00:14:11,171 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:14:11,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:14:11,208 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-01-10 00:14:11,296 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-01-10 00:14:11,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:14:11,436 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-01-10 00:14:11,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:14:11,552 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-01-10 00:14:11,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:14:11,676 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-01-10 00:14:11,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:14:11,753 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-01-10 00:14:11,765 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-01-10 00:14:11,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-01-10 00:14:11,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:14:12,039 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:14:12,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:14:12,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1823))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1824)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:14:12,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1823))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1824)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:14:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283813237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:14:12,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:14:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2025-01-10 00:14:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221810016] [2025-01-10 00:14:12,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:14:12,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:14:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:14:12,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:14:12,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=619, Unknown=36, NotChecked=220, Total=992 [2025-01-10 00:14:12,192 INFO L87 Difference]: Start difference. First operand 1505 states and 1754 transitions. Second operand has 25 states, 22 states have (on average 6.863636363636363) internal successors, (151), 25 states have internal predecessors, (151), 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)