./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_OAT_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:55:44,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:55:44,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:55:44,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:55:44,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:55:44,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:55:44,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:55:44,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:55:44,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:55:44,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:55:44,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:55:44,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:55:44,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:55:44,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:55:44,407 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:55:44,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:55:44,408 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:55:44,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:44,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:44,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:44,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:44,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:55:44,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:55:44,411 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-memcleanup) ) 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2025-01-09 21:55:44,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:55:44,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:55:44,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:55:44,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:55:44,655 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:55:44,656 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_OAT_test2-1.i [2025-01-09 21:55:45,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81281e631/cbbaab2a4d7440ef98d19d9cff4199e8/FLAG17fe5c167 [2025-01-09 21:55:46,127 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:55:46,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-01-09 21:55:46,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81281e631/cbbaab2a4d7440ef98d19d9cff4199e8/FLAG17fe5c167 [2025-01-09 21:55:46,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81281e631/cbbaab2a4d7440ef98d19d9cff4199e8 [2025-01-09 21:55:46,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:55:46,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:55:46,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:46,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:55:46,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:55:46,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ea3e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46, skipping insertion in model container [2025-01-09 21:55:46,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:55:46,581 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-09 21:55:46,598 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-09 21:55:46,600 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-09 21:55:46,602 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-09 21:55:46,605 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-09 21:55:46,625 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-09 21:55:46,625 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-09 21:55:46,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-09 21:55:46,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-09 21:55:46,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:46,640 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:55:46,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:46,738 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:55:46,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46 WrapperNode [2025-01-09 21:55:46,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:46,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:55:46,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:55:46,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:55:46,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,805 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-01-09 21:55:46,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:55:46,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:55:46,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:55:46,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:55:46,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,866 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 21:55:46,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:55:46,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:55:46,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:55:46,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:55:46,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (1/1) ... [2025-01-09 21:55:46,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:46,937 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-09 21:55:46,944 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-09 21:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 21:55:46,960 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 21:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:55:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:55:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:55:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:55:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:55:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:55:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:55:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:55:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 21:55:46,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:55:46,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:55:46,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:55:47,130 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:55:47,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:55:48,120 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-01-09 21:55:48,121 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:55:48,138 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:55:48,139 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 21:55:48,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:48 BoogieIcfgContainer [2025-01-09 21:55:48,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:55:48,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:55:48,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:55:48,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:55:48,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:55:46" (1/3) ... [2025-01-09 21:55:48,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8e99aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:48, skipping insertion in model container [2025-01-09 21:55:48,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:46" (2/3) ... [2025-01-09 21:55:48,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8e99aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:48, skipping insertion in model container [2025-01-09 21:55:48,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:48" (3/3) ... [2025-01-09 21:55:48,147 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2025-01-09 21:55:48,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:55:48,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 6 procedures, 392 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 21:55:48,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:55:48,203 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;@3b5f0573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:55:48,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:55:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 21:55:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 21:55:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:48,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:55:48,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:48,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1579356390, now seen corresponding path program 1 times [2025-01-09 21:55:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:48,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588189876] [2025-01-09 21:55:48,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:48,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 21:55:48,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 21:55:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:48,330 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-09 21:55:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588189876] [2025-01-09 21:55:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588189876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:48,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:48,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:55:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667418888] [2025-01-09 21:55:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:48,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:55:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:55:48,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:55:48,354 INFO L87 Difference]: Start difference. First operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:55:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:48,391 INFO L93 Difference]: Finished difference Result 382 states and 555 transitions. [2025-01-09 21:55:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:55:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 21:55:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:48,398 INFO L225 Difference]: With dead ends: 382 [2025-01-09 21:55:48,400 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 21:55:48,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:55:48,404 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:48,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:55:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 21:55:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-01-09 21:55:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.4617486338797814) internal successors, (535), 373 states have internal predecessors, (535), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:55:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 553 transitions. [2025-01-09 21:55:48,441 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 553 transitions. Word has length 7 [2025-01-09 21:55:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:48,442 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 553 transitions. [2025-01-09 21:55:48,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:55:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 553 transitions. [2025-01-09 21:55:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:55:48,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:48,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:55:48,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:55:48,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -877250352, now seen corresponding path program 1 times [2025-01-09 21:55:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847276717] [2025-01-09 21:55:48,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:48,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:55:48,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:55:48,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:48,553 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-09 21:55:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847276717] [2025-01-09 21:55:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847276717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:48,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:55:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16559867] [2025-01-09 21:55:48,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:48,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:55:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:48,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:55:48,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:55:48,558 INFO L87 Difference]: Start difference. First operand 380 states and 553 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:55:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:48,687 INFO L93 Difference]: Finished difference Result 743 states and 1090 transitions. [2025-01-09 21:55:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:55:48,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 21:55:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:48,692 INFO L225 Difference]: With dead ends: 743 [2025-01-09 21:55:48,694 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 21:55:48,694 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-09 21:55:48,695 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 517 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:48,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1591 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:55:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 21:55:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 382. [2025-01-09 21:55:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.4592391304347827) internal successors, (537), 375 states have internal predecessors, (537), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:55:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 555 transitions. [2025-01-09 21:55:48,713 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 555 transitions. Word has length 9 [2025-01-09 21:55:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:48,713 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 555 transitions. [2025-01-09 21:55:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:55:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 555 transitions. [2025-01-09 21:55:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:55:48,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:48,715 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:48,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:55:48,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:48,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1909968268, now seen corresponding path program 1 times [2025-01-09 21:55:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:48,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404087461] [2025-01-09 21:55:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:48,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:55:48,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:55:48,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:48,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:55:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404087461] [2025-01-09 21:55:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404087461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:55:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413250815] [2025-01-09 21:55:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:49,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:55:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:49,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:55:49,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:55:49,046 INFO L87 Difference]: Start difference. First operand 382 states and 555 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 21:55:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:49,116 INFO L93 Difference]: Finished difference Result 385 states and 551 transitions. [2025-01-09 21:55:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:55:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-01-09 21:55:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:49,118 INFO L225 Difference]: With dead ends: 385 [2025-01-09 21:55:49,118 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 21:55:49,118 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-09 21:55:49,118 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 105 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:49,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1485 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:55:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 21:55:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2025-01-09 21:55:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.440217391304348) internal successors, (530), 375 states have internal predecessors, (530), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:55:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 548 transitions. [2025-01-09 21:55:49,138 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 548 transitions. Word has length 85 [2025-01-09 21:55:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 548 transitions. [2025-01-09 21:55:49,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 21:55:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 548 transitions. [2025-01-09 21:55:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:55:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:49,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:55:49,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 380494336, now seen corresponding path program 1 times [2025-01-09 21:55:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643414561] [2025-01-09 21:55:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:49,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:55:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:55:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:55:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643414561] [2025-01-09 21:55:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643414561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:49,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:55:49,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618579812] [2025-01-09 21:55:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:55:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:49,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:55:49,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:55:49,342 INFO L87 Difference]: Start difference. First operand 382 states and 548 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-09 21:55:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:49,413 INFO L93 Difference]: Finished difference Result 660 states and 962 transitions. [2025-01-09 21:55:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:55:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2025-01-09 21:55:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:49,415 INFO L225 Difference]: With dead ends: 660 [2025-01-09 21:55:49,415 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 21:55:49,416 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-09 21:55:49,416 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 348 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:49,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1275 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:55:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 21:55:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 656. [2025-01-09 21:55:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 637 states have (on average 1.4615384615384615) internal successors, (931), 649 states have internal predecessors, (931), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:55:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 959 transitions. [2025-01-09 21:55:49,439 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 959 transitions. Word has length 85 [2025-01-09 21:55:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 959 transitions. [2025-01-09 21:55:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-09 21:55:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 959 transitions. [2025-01-09 21:55:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:55:49,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:49,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:49,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:55:49,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 209796900, now seen corresponding path program 1 times [2025-01-09 21:55:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487992920] [2025-01-09 21:55:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:49,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:55:49,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:55:49,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:49,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487992920] [2025-01-09 21:55:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487992920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:49,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:55:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507510039] [2025-01-09 21:55:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:49,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:55:49,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:49,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:55:49,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:55:49,640 INFO L87 Difference]: Start difference. First operand 656 states and 959 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:49,679 INFO L93 Difference]: Finished difference Result 668 states and 971 transitions. [2025-01-09 21:55:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:55:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:55:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:49,682 INFO L225 Difference]: With dead ends: 668 [2025-01-09 21:55:49,682 INFO L226 Difference]: Without dead ends: 668 [2025-01-09 21:55:49,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:55:49,683 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:49,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:55:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-01-09 21:55:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-01-09 21:55:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 649 states have (on average 1.453004622496148) internal successors, (943), 661 states have internal predecessors, (943), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:55:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 971 transitions. [2025-01-09 21:55:49,695 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 971 transitions. Word has length 100 [2025-01-09 21:55:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:49,696 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 971 transitions. [2025-01-09 21:55:49,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 971 transitions. [2025-01-09 21:55:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:55:49,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:49,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:49,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:55:49,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 702423074, now seen corresponding path program 1 times [2025-01-09 21:55:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526398692] [2025-01-09 21:55:49,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:49,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:55:49,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:55:49,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:55:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526398692] [2025-01-09 21:55:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526398692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:50,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:55:50,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983083149] [2025-01-09 21:55:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:50,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:55:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:50,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:55:50,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:55:50,037 INFO L87 Difference]: Start difference. First operand 668 states and 971 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:50,137 INFO L93 Difference]: Finished difference Result 914 states and 1334 transitions. [2025-01-09 21:55:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:55:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:55:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:50,142 INFO L225 Difference]: With dead ends: 914 [2025-01-09 21:55:50,142 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 21:55:50,142 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-09 21:55:50,144 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 506 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:50,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1658 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:55:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 21:55:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 670. [2025-01-09 21:55:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 651 states have (on average 1.4516129032258065) internal successors, (945), 663 states have internal predecessors, (945), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:55:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 973 transitions. [2025-01-09 21:55:50,167 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 973 transitions. Word has length 100 [2025-01-09 21:55:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:50,168 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 973 transitions. [2025-01-09 21:55:50,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 973 transitions. [2025-01-09 21:55:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:55:50,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:50,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:55:50,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 910762525, now seen corresponding path program 1 times [2025-01-09 21:55:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065193712] [2025-01-09 21:55:50,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:50,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:55:50,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:55:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:55:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065193712] [2025-01-09 21:55:50,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065193712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:50,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:55:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074934046] [2025-01-09 21:55:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:50,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:55:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:55:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:55:50,400 INFO L87 Difference]: Start difference. First operand 670 states and 973 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:50,462 INFO L93 Difference]: Finished difference Result 676 states and 965 transitions. [2025-01-09 21:55:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:55:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:55:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:50,465 INFO L225 Difference]: With dead ends: 676 [2025-01-09 21:55:50,465 INFO L226 Difference]: Without dead ends: 676 [2025-01-09 21:55:50,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:55:50,466 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 88 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:50,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1971 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:55:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-01-09 21:55:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 670. [2025-01-09 21:55:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 651 states have (on average 1.4301075268817205) internal successors, (931), 663 states have internal predecessors, (931), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:55:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 959 transitions. [2025-01-09 21:55:50,481 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 959 transitions. Word has length 156 [2025-01-09 21:55:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:50,481 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 959 transitions. [2025-01-09 21:55:50,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 959 transitions. [2025-01-09 21:55:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:55:50,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:50,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:55:50,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -260751599, now seen corresponding path program 1 times [2025-01-09 21:55:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:50,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640053287] [2025-01-09 21:55:50,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:50,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:55:50,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:55:50,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:50,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:55:50,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640053287] [2025-01-09 21:55:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640053287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:50,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:50,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:55:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646872660] [2025-01-09 21:55:50,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:50,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:55:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:50,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:55:50,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:55:50,635 INFO L87 Difference]: Start difference. First operand 670 states and 959 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:50,679 INFO L93 Difference]: Finished difference Result 574 states and 799 transitions. [2025-01-09 21:55:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:55:50,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:55:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:50,682 INFO L225 Difference]: With dead ends: 574 [2025-01-09 21:55:50,682 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 21:55:50,682 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-09 21:55:50,682 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 9 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:50,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1313 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:55:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 21:55:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-01-09 21:55:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 555 states have (on average 1.3891891891891892) internal successors, (771), 567 states have internal predecessors, (771), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:55:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 799 transitions. [2025-01-09 21:55:50,695 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 799 transitions. Word has length 156 [2025-01-09 21:55:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 799 transitions. [2025-01-09 21:55:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 799 transitions. [2025-01-09 21:55:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:55:50,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:50,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:55:50,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1111055699, now seen corresponding path program 1 times [2025-01-09 21:55:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775955263] [2025-01-09 21:55:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:50,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:55:50,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:55:50,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775955263] [2025-01-09 21:55:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775955263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:50,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:55:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391384314] [2025-01-09 21:55:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:55:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:50,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:55:50,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:55:50,920 INFO L87 Difference]: Start difference. First operand 574 states and 799 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:51,264 INFO L93 Difference]: Finished difference Result 658 states and 907 transitions. [2025-01-09 21:55:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:55:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:55:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:51,267 INFO L225 Difference]: With dead ends: 658 [2025-01-09 21:55:51,267 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 21:55:51,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 21:55:51,268 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 946 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:51,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1467 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:55:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 21:55:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 477. [2025-01-09 21:55:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 463 states have (on average 1.388768898488121) internal successors, (643), 470 states have internal predecessors, (643), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:55:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2025-01-09 21:55:51,279 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 156 [2025-01-09 21:55:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2025-01-09 21:55:51,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2025-01-09 21:55:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 21:55:51,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:51,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:51,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:55:51,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293762, now seen corresponding path program 1 times [2025-01-09 21:55:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403740431] [2025-01-09 21:55:51,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:55:51,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:55:51,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:51,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403740431] [2025-01-09 21:55:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403740431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:55:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895139391] [2025-01-09 21:55:51,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:51,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:51,820 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-09 21:55:51,821 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-09 21:55:52,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:55:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:55:52,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:52,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:52,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:55:52,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:55:52,153 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 11 treesize of output 7 [2025-01-09 21:55:52,362 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 21:55:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:52,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:55:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895139391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:55:52,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:55:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 21:55:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132504308] [2025-01-09 21:55:52,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:55:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:55:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:52,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:55:52,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:55:52,560 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 21:55:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:52,815 INFO L93 Difference]: Finished difference Result 1355 states and 1880 transitions. [2025-01-09 21:55:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:55:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 166 [2025-01-09 21:55:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:52,822 INFO L225 Difference]: With dead ends: 1355 [2025-01-09 21:55:52,822 INFO L226 Difference]: Without dead ends: 1355 [2025-01-09 21:55:52,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:55:52,822 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2862 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2876 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2876 Valid, 4807 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:55:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-01-09 21:55:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 920. [2025-01-09 21:55:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 902 states have (on average 1.3880266075388026) internal successors, (1252), 909 states have internal predecessors, (1252), 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-09 21:55:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1276 transitions. [2025-01-09 21:55:52,838 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1276 transitions. Word has length 166 [2025-01-09 21:55:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1276 transitions. [2025-01-09 21:55:52,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 21:55:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1276 transitions. [2025-01-09 21:55:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 21:55:52,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:52,842 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:52,853 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-09 21:55:53,047 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,SelfDestructingSolverStorable9 [2025-01-09 21:55:53,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 481277528, now seen corresponding path program 1 times [2025-01-09 21:55:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452668741] [2025-01-09 21:55:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:53,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:55:53,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:55:53,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:53,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452668741] [2025-01-09 21:55:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452668741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:55:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201603152] [2025-01-09 21:55:55,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:55,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:55,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:55,376 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-09 21:55:55,379 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-09 21:55:55,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:55:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:55:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:55,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:55,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:55:55,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:55:55,963 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 11 treesize of output 7 [2025-01-09 21:55:56,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 21:55:56,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 21:55:56,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 21:55:56,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 21:55:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:56,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:55:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:55:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201603152] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:55:56,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:55:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2025-01-09 21:55:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165156305] [2025-01-09 21:55:56,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:55:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 21:55:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:56,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 21:55:56,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-01-09 21:55:56,926 INFO L87 Difference]: Start difference. First operand 920 states and 1276 transitions. Second operand has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 21:55:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:57,658 INFO L93 Difference]: Finished difference Result 2867 states and 3995 transitions. [2025-01-09 21:55:57,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 21:55:57,659 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 394 [2025-01-09 21:55:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:57,669 INFO L225 Difference]: With dead ends: 2867 [2025-01-09 21:55:57,669 INFO L226 Difference]: Without dead ends: 2867 [2025-01-09 21:55:57,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 21:55:57,671 INFO L435 NwaCegarLoop]: 1788 mSDtfsCounter, 6893 mSDsluCounter, 12073 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6928 SdHoareTripleChecker+Valid, 13861 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:57,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6928 Valid, 13861 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:55:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2025-01-09 21:55:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2072. [2025-01-09 21:55:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2048 states have (on average 1.3935546875) internal successors, (2854), 2055 states have internal predecessors, (2854), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:55:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2890 transitions. [2025-01-09 21:55:57,714 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2890 transitions. Word has length 394 [2025-01-09 21:55:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:57,716 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 2890 transitions. [2025-01-09 21:55:57,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 21:55:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2890 transitions. [2025-01-09 21:55:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 21:55:57,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:57,734 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:57,745 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-09 21:55:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:57,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:57,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash -113756668, now seen corresponding path program 2 times [2025-01-09 21:55:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:57,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976028800] [2025-01-09 21:55:57,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:55:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:58,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 850 statements into 2 equivalence classes. [2025-01-09 21:55:58,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 850 statements. [2025-01-09 21:55:58,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:55:58,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:55:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:55:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976028800] [2025-01-09 21:55:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976028800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:55:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22726351] [2025-01-09 21:55:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:58,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:55:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:55:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:55:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:55:58,358 INFO L87 Difference]: Start difference. First operand 2072 states and 2890 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:58,636 INFO L93 Difference]: Finished difference Result 2077 states and 2895 transitions. [2025-01-09 21:55:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:55:58,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 21:55:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:58,643 INFO L225 Difference]: With dead ends: 2077 [2025-01-09 21:55:58,643 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 21:55:58,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:55:58,644 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 34 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:58,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2278 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:55:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 21:55:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2076. [2025-01-09 21:55:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2052 states have (on average 1.3927875243664718) internal successors, (2858), 2059 states have internal predecessors, (2858), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:55:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2894 transitions. [2025-01-09 21:55:58,670 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2894 transitions. Word has length 850 [2025-01-09 21:55:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:58,670 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2894 transitions. [2025-01-09 21:55:58,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:55:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2894 transitions. [2025-01-09 21:55:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:55:58,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:58,682 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:55:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:55:58,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2038204040, now seen corresponding path program 1 times [2025-01-09 21:55:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:55:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083512257] [2025-01-09 21:55:58,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:55:58,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:55:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:55:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:56:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:56:01,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083512257] [2025-01-09 21:56:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083512257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:01,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:56:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662602028] [2025-01-09 21:56:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:56:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:56:01,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:56:01,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:56:01,111 INFO L87 Difference]: Start difference. First operand 2076 states and 2894 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:01,434 INFO L93 Difference]: Finished difference Result 2081 states and 2900 transitions. [2025-01-09 21:56:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:56:01,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 21:56:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:01,443 INFO L225 Difference]: With dead ends: 2081 [2025-01-09 21:56:01,443 INFO L226 Difference]: Without dead ends: 2081 [2025-01-09 21:56:01,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:56:01,444 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 9 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2268 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:56:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-01-09 21:56:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2080. [2025-01-09 21:56:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2056 states have (on average 1.392509727626459) internal successors, (2863), 2063 states have internal predecessors, (2863), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:56:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2899 transitions. [2025-01-09 21:56:01,481 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2899 transitions. Word has length 851 [2025-01-09 21:56:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:01,483 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 2899 transitions. [2025-01-09 21:56:01,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2899 transitions. [2025-01-09 21:56:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:56:01,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:01,495 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:56:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:56:01,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:01,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash 298942988, now seen corresponding path program 1 times [2025-01-09 21:56:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:56:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602739584] [2025-01-09 21:56:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:56:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:56:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:56:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:56:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:56:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602739584] [2025-01-09 21:56:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602739584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:56:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187102619] [2025-01-09 21:56:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:56:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:56:03,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:56:03,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:56:03,430 INFO L87 Difference]: Start difference. First operand 2080 states and 2899 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:03,660 INFO L93 Difference]: Finished difference Result 2085 states and 2905 transitions. [2025-01-09 21:56:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:56:03,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 21:56:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:03,666 INFO L225 Difference]: With dead ends: 2085 [2025-01-09 21:56:03,666 INFO L226 Difference]: Without dead ends: 2085 [2025-01-09 21:56:03,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:56:03,667 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 10 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:03,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2300 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:56:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-01-09 21:56:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2080. [2025-01-09 21:56:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2056 states have (on average 1.392509727626459) internal successors, (2863), 2063 states have internal predecessors, (2863), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:56:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2899 transitions. [2025-01-09 21:56:03,692 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2899 transitions. Word has length 851 [2025-01-09 21:56:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:03,693 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 2899 transitions. [2025-01-09 21:56:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2899 transitions. [2025-01-09 21:56:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-01-09 21:56:03,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:03,700 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:56:03,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:56:03,700 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2129416592, now seen corresponding path program 1 times [2025-01-09 21:56:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:56:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979966242] [2025-01-09 21:56:03,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:56:03,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-01-09 21:56:04,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-01-09 21:56:04,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:04,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:56:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:56:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979966242] [2025-01-09 21:56:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979966242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:56:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422475717] [2025-01-09 21:56:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 21:56:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:56:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 21:56:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:56:05,299 INFO L87 Difference]: Start difference. First operand 2080 states and 2899 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:05,660 INFO L93 Difference]: Finished difference Result 2091 states and 2913 transitions. [2025-01-09 21:56:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:56:05,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 852 [2025-01-09 21:56:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:05,667 INFO L225 Difference]: With dead ends: 2091 [2025-01-09 21:56:05,667 INFO L226 Difference]: Without dead ends: 2091 [2025-01-09 21:56:05,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:56:05,668 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 27 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:05,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3141 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:56:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-01-09 21:56:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2088. [2025-01-09 21:56:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2064 states have (on average 1.3919573643410852) internal successors, (2873), 2071 states have internal predecessors, (2873), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:56:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2909 transitions. [2025-01-09 21:56:05,692 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2909 transitions. Word has length 852 [2025-01-09 21:56:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:05,693 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2909 transitions. [2025-01-09 21:56:05,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2909 transitions. [2025-01-09 21:56:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:56:05,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:05,701 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:56:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:56:05,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:05,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1198784621, now seen corresponding path program 1 times [2025-01-09 21:56:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:56:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871097513] [2025-01-09 21:56:05,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:56:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 21:56:06,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 21:56:06,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:06,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:56:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:56:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871097513] [2025-01-09 21:56:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871097513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:07,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:56:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611313639] [2025-01-09 21:56:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:56:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:56:07,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:56:07,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:56:07,287 INFO L87 Difference]: Start difference. First operand 2088 states and 2909 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:07,531 INFO L93 Difference]: Finished difference Result 2091 states and 2912 transitions. [2025-01-09 21:56:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:56:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 853 [2025-01-09 21:56:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:07,536 INFO L225 Difference]: With dead ends: 2091 [2025-01-09 21:56:07,537 INFO L226 Difference]: Without dead ends: 2091 [2025-01-09 21:56:07,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:56:07,538 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 4 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:07,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2288 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:56:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-01-09 21:56:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2025-01-09 21:56:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2067 states have (on average 1.3913884857281085) internal successors, (2876), 2074 states have internal predecessors, (2876), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:56:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2912 transitions. [2025-01-09 21:56:07,559 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2912 transitions. Word has length 853 [2025-01-09 21:56:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 2091 states and 2912 transitions. [2025-01-09 21:56:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:56:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2912 transitions. [2025-01-09 21:56:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:56:07,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:07,565 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:56:07,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:56:07,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:07,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1601539951, now seen corresponding path program 1 times [2025-01-09 21:56:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:56:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662088548] [2025-01-09 21:56:07,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:56:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes.